Abstract
We come to the most important idea in enumerative combinatorics, which will allow surprisingly simple proofs of identities and recurrences. Suppose we are interested in the counting function f: ℕ0 → ℂ. We associate to f the formal series F(z) = Σ n≥0 f(n)z n, and say that F(z) is the generating function of f
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
M. Aigner (1997): Combinatorial Theory. Reprint of the 1979 edition. Springer, Berlin.
P. Flajolet and R. Sedgewick (2006): Analytical Combinatorics. Preliminary version available on the Web.
R.L. Graham, D.E. Knuth, and O. Patashnik (1994): Concrete Mathematics, 2nd edition. Addison-Wesley, Reading.
L. Lovász (1979): Combinatorial Problems and Exercises. North-Holland, Amsterdam.
I. Niven (1969): Formal power series. Amer. Math. Monthly 76, 871–889.
G. Pólya (1921): Über eine Aufgabe der Wahrscheinlichkeitstheorie betreffend die Irrfahrt im Straßennetz. Math. Annalen 84, 149–160.
J. Riordan (1968): Combinatorial Identities. Wiley, New York.
R.P. Stanley (1997/9): Enumerative Combinatorics, 2 vols. Cambridge Univ. Press, Cambridge/New York.
J.H. van Lint and R.M. Wilson (1996): A Course in Combinatorics. Cambridge Univ. Press, Cambridge.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Formal Series and Infinite Matrices. In: A Course in Enumeration. Graduate Texts in Mathematics, vol 238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39035-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-39035-0_3
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)