Abstract
In Chaps. 5 and 6 we considered the quotient poset B n ∕ G, where G is a subgroup of the symmetric group \(\mathfrak{S}_{n}\). If p i is the number of elements of rank i of this poset, then the sequence p 0, p 1, …, p n is rank-symmetric and rank-unimodal.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
W. Burnside, Theory of Groups of Finite Order (Cambridge University Press, Cambridge, 1897)
W. Burnside, Theory of Groups of Finite Order, 2nd edn. (Cambridge University Press, Cambridge, 1911); Reprinted by Dover, New York, 1955
A.L. Cauchy, Mémoire sur diverses propriétés remarquables des substitutions régulaires ou irrégulaires, et des systèmes de substitutions conjuguées (suite). C. R. Acad. Sci. Paris 21, 972–987 (1845); Oeuvres Ser. 1 9, 371–387
N.G. de Bruijn, Pólya’s theory of counting, in Applied Combinatorial Mathematics, ed. by E.F. Beckenbach (Wiley, New York, 1964); Reprinted by Krieger, Malabar, FL, 1981
F.G. Frobenius, Über die Congruenz nach einem aus zwei endlichen Gruppen gebildeten Doppelmodul. J. Reine Angew. Math. (Crelle’s J.) 101, 273–299 (1887); Reprinted in Gesammelte Abhandlungen, vol. 2 (Springer, Heidelberg, 1988), pp. 304–330
F.G. Frobenius, Über die Charaktere der symmetrischen Gruppe, in Sitzungsber. Kön. Preuss. Akad. Wissen. Berlin (1900), pp. 516–534; Gesammelte Abh. III, ed. by J.-P. Serre (Springer, Berlin, 1968), pp. 148–166
J.I. Hall, E.M. Palmer, R.W. Robinson, Redfield’s lost paper in a modern context. J. Graph Theor. 8, 225–240 (1984)
F. Harary, E.M. Palmer, Graphical Enumeration (Academic, New York, 1973)
F. Harary, R.W. Robinson, The rediscovery of Redfield’s papers. J. Graph Theory 8, 191–192 (1984)
A. Hurwitz, Über die Anzahl der Riemannschen Flächen mit gegebenen Verzweigungspunkten. Math. Ann. 55, 53–66 (1902)
E.K. Lloyd, J. Howard Redfield: 1879–1944. J. Graph Theor. 8, 195–203 (1984)
P.M. Neumann, A lemma that is not Burnside’s. Math. Sci. 4, 133–141 (1979)
G. Pólya, Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Math. 68, 145–254 (1937)
G. Pólya, R.C. Read, Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds (Springer, New York, 1987)
J.H. Redfield, The theory of group reduced distributions. Am. J. Math. 49, 433–455 (1927)
J.H. Redfield, Enumeration by frame group and range groups. J. Graph Theor. 8, 205–223 (1984)
R. Stanley, Enumerative Combinatorics, vol. 2 (Cambridge University Press, New York, 1999)
E.M. Wright, Burnside’s lemma: a historical note. J. Comb. Theor. B 30, 89–90 (1981)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Stanley, R.P. (2013). Enumeration Under Group Action. In: Algebraic Combinatorics. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6998-8_7
Download citation
DOI: https://doi.org/10.1007/978-1-4614-6998-8_7
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-6997-1
Online ISBN: 978-1-4614-6998-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)