combinatorial enumeration groups graphs de polya georg (16 resultados)

Paperback. Condición: 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.

Condición: New.

Paperback or Softback. Condición: New. Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds. Book.

Hardcover. Condición: Good. 0387964134 Good; Hardcover; 1987, Springer-Verlag Publishing; Former library copy with standard library markings; Moderate wear to covers; Library stamps to endpapers; Text pages clean & unmarked; Good binding with straight spine; Yellow cloth covers with title in black lettering; 148 pages; "Combinatorial Enumerations of Groups, Graphs, and Chemical Compounds," by Georg Polya & R.C. Read.

Condición: New. In.

Condición: New. pp. 162.

Paperback. Condición: Brand New. reprint edition. 148 pages. 9.00x6.00x0.25 inches. In Stock.

Condición: New.

Taschenbuch. Condición: Neu. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 160 pp. Englisch.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Paperback. Condición: 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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Condición: new.

Taschenbuch. Condición: 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.

Condición: New. Print on Demand pp. 162 17 Figures, 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Paperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 267.

Condición: New. PRINT ON DEMAND pp. 162.