Mohlo by sa vám tiež páčiť

Viac informácií o knihe Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 175 bodov

Anotácia knihy

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.

Parametre knihy

Zaradenie knihy Knihy po anglicky Mathematics & science Mathematics Combinatorics & graph theory

• Celý názov: Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds
• Autor: Georg Polya, R. C. Read
• Jazyk: Angličtina
• Väzba: Brožovaná
• Počet strán: 148
• EAN: 9781461291053
• ISBN: 1461291054
• ID: 06795919
• Nakladateľ: Springer-Verlag New York Inc.
• Hmotnosť: 254 g
• Rozmery: 235 × 155 × 8 mm
• Dátum vydania: 02. October 2011

Obľúbené z iného súdka

---

---

---