Articoli correlati a Combinatorial Enumeration of Groups, Graphs, and Chemical...
Sinossi
In 1937 there appeared a paper that was to have a profound influence on the progress of combinatorial enumeration, both in its theoretical and applied aspects. Entitled Kombinatorische Anzahlbest immungen jUr Gruppen, Graphen und chemische Verbindungen, it was published in Acta Mathematica, Vol. 68, pp. 145 to 254. Its author, George Polya, was already a mathematician of considerable stature, well-known for outstanding work in many branches of mathematics, particularly analysis. The paper in Question was unusual in that it depended almost entirely on a single theorem -- the "Hauptsatz" of Section 4 -- a theorem which gave a method for solving a general type of enumera tion problem. On the face of it, this is not something that one would expect to run to over 100 pages. Yet the range of the applica tions of the theorem and of its ramifications was enormous, as Polya clearly showed. In the various sections of his paper he explored many applications to the enumeration of graphs, principally trees, and of chemical isomers, using his theorem to present a comprehen sive and unified treatment of problems which had previously been solved, if at all, only by ad hoc methods. In the final section he investigated the asymptotic properties of these enumerational results, bringing to bear his formidable insight as an analyst.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
1 Groups.- 2 Graphs.- 3 Chemical Compounds.- 4 Asymptotic Evaluation of the Number of Combinations.- The Legacy of Pólya’s Paper: Fifty Years of Pólya Theory.- References.
Product Description
Book by Polya Georg Read RC
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 53,17
EUR 2,25 per la spedizione in U.S.A.
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per Combinatorial Enumeration of Groups, Graphs, and Chemical...
Immagini fornite dal venditore
Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 18685941-n
Quantitą: 15 disponibili
Foto dell'editore
Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar2716030030297
Quantitą: Pił di 20 disponibili
Foto dell'editore
Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds (Paperback)
Editore:
Springer-Verlag New York Inc., New York, NY, 2011
ISBN 10: 1461291054
ISBN 13: 9781461291053
Nuovo
Paperback
Da: Grand Eagle Retail, Mason, OH, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: new. Paperback. In 1937 there appeared a paper that was to have a profound influence on the progress of combinatorial enumeration, both in its theoretical and applied aspects. Entitled Kombinatorische Anzahlbest- immungen jUr Gruppen, Graphen und chemische Verbindungen, it was published in Acta Mathematica, Vol. 68, pp. 145 to 254. Its author, George Polya, was already a mathematician of considerable stature, well-known for outstanding work in many branches of mathematics, particularly analysis. The paper in Question was unusual in that it depended almost entirely on a single theorem -- the "Hauptsatz" of Section 4 -- a theorem which gave a method for solving a general type of enumera- tion problem. On the face of it, this is not something that one would expect to run to over 100 pages. Yet the range of the applica- tions of the theorem and of its ramifications was enormous, as Polya clearly showed. In the various sections of his paper he explored many applications to the enumeration of graphs, principally trees, and of chemical isomers, using his theorem to present a comprehen- sive and unified treatment of problems which had previously been solved, if at all, only by ad hoc methods.In the final section he investigated the asymptotic properties of these enumerational results, bringing to bear his formidable insight as an analyst. In 1937 there appeared a paper that was to have a profound influence on the progress of combinatorial enumeration, both in its theoretical and applied aspects. Entitled Kombinatorische AnzahlbestA immungen jUr Gruppen, Graphen und chemische Verbindungen, it was published in Acta Mathematica, Vol. 68, pp. 145 to 254. Its author, George Polya, was already a mathematician of considerable stature, well-known for outstanding work in many branches of mathematics, particularly analysis. The paper in Question was unusual in that it depended almost entirely on a single theorem — the "Hauptsatz" of Section 4 — a theorem which gave a method for solving a general type of enumeraA tion problem. On the face of it, this is not something that one would expect to run to over 100 pages. Yet the range of the applicaA tions of the theorem and of its ramifications was enormous, as Polya clearly showed. In the various sections of his paper he explored many applications to the enumeration of graphs, principally trees, and of chemical isomers, using his theorem to present a comprehenA sive and unified treatment of problems which had previously been solved, if at all, only by ad hoc methods. In the final section he investigated the asymptotic properties of these enumerational results, bringing to bear his formidable insight as an anal Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9781461291053
Quantitą: 1 disponibili
Foto dell'editore
Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds
Da: Best Price, Torrance, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. SUPER FAST SHIPPING. Codice articolo 9781461291053
Quantitą: 1 disponibili
Immagini fornite dal venditore
Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds (Paperback or Softback)
Editore:
Springer 10/2/2011, 2011
ISBN 10: 1461291054
ISBN 13: 9781461291053
Nuovo
Paperback or Softback
Da: BargainBookStores, Grand Rapids, MI, U.S.A.
Valutazione del venditore 4 su 5 stelle
Paperback or Softback. Condizione: New. Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds. Book. Codice articolo BBS-9781461291053
Quantitą: 5 disponibili
Immagini fornite dal venditore
Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 18685941
Quantitą: 15 disponibili
Foto dell'editore
Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9781461291053_new
Quantitą: Pił di 20 disponibili
Foto dell'editore
Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 162. Codice articolo 2658567093
Quantitą: 4 disponibili
Immagini fornite dal venditore
Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds
Editore:
Springer New York Okt 2011, 2011
ISBN 10: 1461291054
ISBN 13: 9781461291053
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In 1937 there appeared a paper that was to have a profound influence on the progress of combinatorial enumeration, both in its theoretical and applied aspects. Entitled Kombinatorische Anzahlbest immungen jUr Gruppen, Graphen und chemische Verbindungen, it was published in Acta Mathematica, Vol. 68, pp. 145 to 254. Its author, George Polya, was already a mathematician of considerable stature, well-known for outstanding work in many branches of mathematics, particularly analysis. The paper in Question was unusual in that it depended almost entirely on a single theorem -- the 'Hauptsatz' of Section 4 -- a theorem which gave a method for solving a general type of enumera tion problem. On the face of it, this is not something that one would expect to run to over 100 pages. Yet the range of the applica tions of the theorem and of its ramifications was enormous, as Polya clearly showed. In the various sections of his paper he explored many applications to the enumeration of graphs, principally trees, and of chemical isomers, using his theorem to present a comprehen sive and unified treatment of problems which had previously been solved, if at all, only by ad hoc methods. In the final section he investigated the asymptotic properties of these enumerational results, bringing to bear his formidable insight as an analyst. 160 pp. Englisch. Codice articolo 9781461291053
Quantitą: 2 disponibili
Foto dell'editore
Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds
Editore:
Springer-Verlag New York Inc., 2011
ISBN 10: 1461291054
ISBN 13: 9781461291053
Nuovo
Paperback / softback
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 267. Codice articolo C9781461291053
Quantitą: Pił di 20 disponibili