Abstract
It is not clear why another generating function is needed, but it turns out that when we count the number of permutations of different types, these are the natural generating function. We can see this by looking at a simple enumeration: the number of permutations of r things.
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this chapter
Cite this chapter
Camina, A., Lewis, B. (2011). Exponential Generating Functions. In: An Introduction to Enumeration. Springer Undergraduate Mathematics Series. Springer, London. https://doi.org/10.1007/978-0-85729-600-9_7
Download citation
DOI: https://doi.org/10.1007/978-0-85729-600-9_7
Publisher Name: Springer, London
Print ISBN: 978-0-85729-599-6
Online ISBN: 978-0-85729-600-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)