Abstract
You may recall from a calculus class the geometric series:
The coefficients in the (MacLaurin) series expansion of a function F(z) define a sequence of numbers. Generally, if F(z) has MacLaurin series
we can relate the function F with the sequence \(a_0, a_1, a_2,\ldots \). So the function \(1/(1-z)\) encodes the rather boring sequence \(1, 1, 1,\ldots \).
“A generating function is a clothesline on which we hang up a sequence of numbers for display.”
–Herb Wilf
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Petersen, T.K. (2019). Generating functions. In: Inquiry-Based Enumerative Combinatorics. Undergraduate Texts in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-030-18308-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-18308-0_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18307-3
Online ISBN: 978-3-030-18308-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)