Abstract
Pólya’s title for this part of the course was actually “Counting Configurations Non-Equivalent with Respect to a Given Permutation Group”. Just about everybody else refers to it as “Pólya’s Theory of Counting”. This latter title is somewhat easier to remember, though not as indicative of the content. We’ll stick to the simpler title; for the content, read on!
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer Science+Business Media New York
About this chapter
Cite this chapter
Pólya, G., Tarjan, R.E., Woods, D.R. (1983). Pólya’s Theory of Counting. In: Notes on Introductory Combinatorics. Progress in Computer Science, vol 4. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4757-1101-1_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-1101-1_6
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-0-8176-3170-3
Online ISBN: 978-1-4757-1101-1
eBook Packages: Springer Book Archive