Abstract
Many enumeration problems are of a different kind from those we have discussed so far. They are determined by symmetries on the underlying structure. How to approach problems of this type is the content of the present chapter.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Notes and References
N.G. de Bruijn (1964): Pólya’s theory of counting. In: Beckenbach, ed., Applied Combinatorial Mathematics, 144–184. Wiley, New York.
G. Frobenius (1887): Über die Congruenz nach einem aus zwei endlichen Gruppen gebildeten Doppelmodul. Crelle’s Journal 101, 273–299.
F. Harary and E.M. Palmer (1973): Graphical Enumeration. Academic Press, New York.
A. Kerber (1991): Combinatorics via Finite Group Actions. BI Wissenschaftsverlag, Mannheim.
D.E. Knuth (2001): Animals in a cage. Amer. Math. Monthly 108, 469, problem 10875; solution in 110(2003), 243–245.
G. Pólya (1937): Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Sci. Math. 68, 145–254.
G. Pólya and R.C. Read (1987): Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds. Springer, Berlin.
J.H. Redfield (1927): The theory of group-reduced distributions. Amer. J. Math. 49, 433–455.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Enumeration of Patterns. In: A Course in Enumeration. Graduate Texts in Mathematics, vol 238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39035-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-39035-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39032-9
Online ISBN: 978-3-540-39035-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)