Abstract
The notion of combinatorial class provides a deep method in order to solve a huge class of combinatorial problems: indeed we shall see a very efficient technique for calculating, by way of generating formal series, the cardinality of various sets. In particular we will concentrate on the number of sequences containing a given pattern, the number of triangulations of a convex polygon, and the number of rooted plane trees.
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
Notes
- 1.
John Conway (1937-).
- 2.
Christian Goldbach (1690–1764).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Mariconda, C., Tonolo, A. (2016). Symbolic Calculus. In: Discrete Calculus. UNITEXT(), vol 103. Springer, Cham. https://doi.org/10.1007/978-3-319-03038-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-03038-8_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03037-1
Online ISBN: 978-3-319-03038-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)