Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York, NY
Springer New York
1987
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | 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 Anzahlbestimmungen für 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 enumeration 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 applications 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 comprehensive 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 |
| Beschreibung: | 1 Online-Ressource (VIII, 148 p) |
| ISBN: | 9781461246640 9781461291053 |
| DOI: | 10.1007/978-1-4612-4664-0 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV042420324 | ||
| 003 | DE-604 | ||
| 005 | 20171018 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s1987 |||| o||u| ||||||eng d | ||
| 020 | |a 9781461246640 |c Online |9 978-1-4612-4664-0 | ||
| 020 | |a 9781461291053 |c Print |9 978-1-4612-9105-3 | ||
| 024 | 7 | |a 10.1007/978-1-4612-4664-0 |2 doi | |
| 035 | |a (OCoLC)863764860 | ||
| 035 | |a (DE-599)BVBBV042420324 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 511.6 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Pólya, G. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds |c by G. Pólya, R. C. Read |
| 264 | 1 | |a New York, NY |b Springer New York |c 1987 | |
| 300 | |a 1 Online-Ressource (VIII, 148 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a 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 Anzahlbestimmungen für 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 enumeration 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 applications 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 comprehensive 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 | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Kombinatorik |0 (DE-588)4031824-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Pólya-Abzähltheorie |0 (DE-588)4175109-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Chemie |0 (DE-588)4009816-3 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
| 689 | 0 | 1 | |a Chemie |0 (DE-588)4009816-3 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Pólya-Abzähltheorie |0 (DE-588)4175109-7 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Read, R. C. |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4612-4664-0 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027855741 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153092115005440 |
|---|---|
| any_adam_object | |
| author | Pólya, G. |
| author_facet | Pólya, G. |
| author_role | aut |
| author_sort | Pólya, G. |
| author_variant | g p gp |
| building | Verbundindex |
| bvnumber | BV042420324 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)863764860 (DE-599)BVBBV042420324 |
| dewey-full | 511.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.6 |
| dewey-search | 511.6 |
| dewey-sort | 3511.6 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-1-4612-4664-0 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03163nmm a2200517zc 4500</leader><controlfield tag="001">BV042420324</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20171018 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1987 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461246640</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4612-4664-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461291053</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4612-9105-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4612-4664-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863764860</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042420324</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.6</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pólya, G.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds</subfield><subfield code="c">by G. Pólya, R. C. Read</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer New York</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VIII, 148 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">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 Anzahlbestimmungen für 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 enumeration 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 applications 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 comprehensive 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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Pólya-Abzähltheorie</subfield><subfield code="0">(DE-588)4175109-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Chemie</subfield><subfield code="0">(DE-588)4009816-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Chemie</subfield><subfield code="0">(DE-588)4009816-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Pólya-Abzähltheorie</subfield><subfield code="0">(DE-588)4175109-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Read, R. C.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4612-4664-0</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027855741</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV042420324 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:06Z |
| institution | BVB |
| isbn | 9781461246640 9781461291053 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027855741 |
| oclc_num | 863764860 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (VIII, 148 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| publisher | Springer New York |
| record_format | marc |
| spelling | Pólya, G. Verfasser aut Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds by G. Pólya, R. C. Read New York, NY Springer New York 1987 1 Online-Ressource (VIII, 148 p) txt rdacontent c rdamedia cr rdacarrier 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 Anzahlbestimmungen für 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 enumeration 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 applications 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 comprehensive 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 Mathematics Combinatorics Mathematik Kombinatorik (DE-588)4031824-2 gnd rswk-swf Pólya-Abzähltheorie (DE-588)4175109-7 gnd rswk-swf Chemie (DE-588)4009816-3 gnd rswk-swf Kombinatorik (DE-588)4031824-2 s Chemie (DE-588)4009816-3 s 1\p DE-604 Pólya-Abzähltheorie (DE-588)4175109-7 s 2\p DE-604 Read, R. C. Sonstige oth https://doi.org/10.1007/978-1-4612-4664-0 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Pólya, G. Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds Mathematics Combinatorics Mathematik Kombinatorik (DE-588)4031824-2 gnd Pólya-Abzähltheorie (DE-588)4175109-7 gnd Chemie (DE-588)4009816-3 gnd |
| subject_GND | (DE-588)4031824-2 (DE-588)4175109-7 (DE-588)4009816-3 |
| title | Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds |
| title_auth | Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds |
| title_exact_search | Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds |
| title_full | Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds by G. Pólya, R. C. Read |
| title_fullStr | Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds by G. Pólya, R. C. Read |
| title_full_unstemmed | Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds by G. Pólya, R. C. Read |
| title_short | Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds |
| title_sort | combinatorial enumeration of groups graphs and chemical compounds |
| topic | Mathematics Combinatorics Mathematik Kombinatorik (DE-588)4031824-2 gnd Pólya-Abzähltheorie (DE-588)4175109-7 gnd Chemie (DE-588)4009816-3 gnd |
| topic_facet | Mathematics Combinatorics Mathematik Kombinatorik Pólya-Abzähltheorie Chemie |
| url | https://doi.org/10.1007/978-1-4612-4664-0 |
| work_keys_str_mv | AT polyag combinatorialenumerationofgroupsgraphsandchemicalcompounds AT readrc combinatorialenumerationofgroupsgraphsandchemicalcompounds |