Abstract
We begin by collecting a few simple rules that, though obvious, lie at the root of all combinatorial counting. In fact, they are so obvious that they do not need a proof.
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.L. Biggs (1979): The roots of combinatorics. Historia Math. 6, 109–136.
L. Comtet (1974): Advanced Combinatorics. Reidel, Dordrecht and Boston.
N. Elkies, G. Kuperberg, M. Larsen, and J. Propp (1992): Alternating sign matrices and domino tilings, parts I and II. Journal Algebr. Comb. 1, 111–132, 219–234.
D. Foata and M. Schützenberger (1970): Théorie Géometrique des Polynômes Euleriens. Lecture Notes Math. 138. Springer, Berlin.
R.L. Graham, D.E. Knuth, and O. Patashnik (1994): Concrete Mathematics, 2nd edition. Addison-Wesley, Reading.
P.A. MacMahon (1915): Combinatory Analysis, 2 vols. Cambridge Univ. Press, Cambridge; reprinted in one volume by Chelsea, New York, 1960.
J. Riordan (1958): An Introduction to Combinatorial Analysis. Wiley, New York.
N.J.A. Sloane (1994): The New Book of Integer Sequences. Springer, Berlin/New York.
R.P. Stanley (1997/9): Enumerative Combinatorics, 2 vols. Cambridge Univ. Press, Cambridge/New York.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Fundamental Coefficients. In: A Course in Enumeration. Graduate Texts in Mathematics, vol 238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39035-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-39035-0_2
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)