Abstract
Generating functions provide a standard tool for enumeration. In this chapter we combine the use of generating functions with the so-called symbolic method which provides a simple systematic way of obtaining the generating function of a class of combinatorial objects by a symbolic description of the class. Generating functions can be thought of as analytic complex functions or can be viewed simply as formal power series, by disregarding convergence issues. Although we will not completely ignore the analytic perspective, we will mostly adopt this latter point of view. Basic definitions and results on formal power series are included, which includes the useful Lagrange inversion formula.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
P. Flajolet, R. Sedgewick, Analytic Combinatorics (Cambridge University Press, Cambridge, 2009)
P. Henrici. Elements of Numerical Analysis (John Wiley and Sons, New York, 1964)
J.H. van Lint, R. Wilson. A Course in Combinatorics, 2nd edn. (Cambridge University Press, Cambridge, 2001)
R.P. Stanley. Catalan Numbers (Cambridge University Press, Cambridge, 2015)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Ball, S., Serra, O. (2024). Symbolic Enumeration. In: A Course in Combinatorics and Graphs. Compact Textbooks in Mathematics. Birkhäuser, Cham. https://doi.org/10.1007/978-3-031-55384-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-031-55384-4_1
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-031-55383-7
Online ISBN: 978-3-031-55384-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)