Abstract
A partition λ of an integer n ≥ 0 is a sequence λ = (λ 1, λ 2, … ) of integers λ i ≥ 0 satisfying λ 1 ≥ λ 2 ≥⋯ and ∑i≥1 λ i = n. Thus all but finitely many λ i are equal to 0. Each λ i > 0 is called a part of λ. We sometimes suppress 0’s from the notation for λ, e.g., (5, 2, 2, 1), (5, 2, 2, 1, 0, 0, 0), and (5, 2, 2, 1, 0, 0, … ) all represent the same partition λ (of 10, with four parts). If λ is a partition of n, then we denote this by λ ⊢ n or |λ| = n.
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
References
G.E. Andrews, The Theory of Partitions (Addison-Wesley, Reading, 1976)
G.E. Andrews, K. Eriksson, Integer Partitions (Cambridge University Press, Cambridge, 2004)
E.B. Dynkin, Some properties of the weight system of a linear representation of a semisimple Lie group (in Russian). Dokl. Akad. Nauk SSSR (N.S) 71, 221–224 (1950)
E.B. Dynkin, The maximal subgroups of the classical groups. Am. Math. Soc. Transl. Ser. 2 6, 245–378 (1957); Translated from Trudy Moskov. Mat. Obsc. 1, 39–166
K.M. O’Hara, Unimodality of Gaussian coefficients: a constructive proof. J. Comb. Theor. Ser. A 53, 29–52 (1990)
W.V. Parker, The matrices AB and BA. Am. Math. Mon. 60, 316 (1953); Reprinted in Selected Papers on Algebra, ed. by S. Montgomery et al. (Mathematical Association of America, Washington), pp. 331–332
R.A. Proctor, A solution of two difficult combinatorial problems with linear algebra. Am. Math. Mon. 89, 721–734 (1982)
J. Schmid, A remark on characteristic polynomials. Am. Math. Mon. 77, 998–999 (1970); Reprinted in Selected Papers on Algebra, ed. by S. Montgomery et al. (Mathematical Association of America, Washington), pp. 332-333
R. Stanley, Weyl groups, the hard Lefschetz theorem, and the Sperner property. SIAM J. Algebr. Discrete Meth. 1, 168–184 (1980)
R. Stanley, Enumerative Combinatorics, vol. 1, 2nd edn. (Cambridge University Press, Cambridge, 2012)
J.J. Sylvester, Proof of the hitherto undemonstrated fundamental theorem of invariants. Philos. Mag. 5, 178–188 (1878); Collected Mathematical Papers, vol. 3 (Chelsea, New York, 1973), pp. 117–126
D. Zeilberger, Kathy O’Hara’s constructive proof of the unimodality of the Gaussian polynomials. Am. Math. Mon. 96, 590–602 (1989)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Stanley, R.P. (2018). Young Diagrams and q-Binomial Coefficients. In: Algebraic Combinatorics. Undergraduate Texts in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-77173-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-77173-1_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-77172-4
Online ISBN: 978-3-319-77173-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)