The Legacy of Pólya’s Paper: Fifty Years of Pólya Theory

Ronald C. Read
Additional contact information
Ronald C. Read: University of Waterloo

A chapter in Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds, 1987, pp 96-135 from Springer

Abstract: Abstract Pólya’s paper, translated here for the first time, was a landmark in the history of combinatorial analysis. It presented to mathematicians a unified technique for solving a wide class of combinatorial problems — a technique which is summarized in Pólya’s main theorem, the “Hauptsatz” of Section 16 of his paper, which will here be referred to as “Pólya’s Theorem”. This theorem can be explained and expounded in many different ways, and at many different levels, ranging from the down-to-earth to highly abstract. It will be convenient for future reference to review the essentials of Pólya’s Theorem, and to this end I offer the following, rather mundane, way of looking at the type of problem to which the theorem applies and the way that it provides a solution.

Keywords: Automorphism Group; Connected Graph; Rooted Tree; Wreath Product; Unrooted Tree (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-4664-0_6

Ordering information: This item can be ordered from
http://www.springer.com/9781461246640

DOI: 10.1007/978-1-4612-4664-0_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().