Abstract
This chapter studies partitions, and shows how the techniques presented throughout the book can be applied for this purpose. First we study partitions of integers, and their Ferrer diagrams. Then, we present the Stirling numbers of the first kind by their algebraic properties. This leads us to their relation with permutations and cycles. Then, we present the Stirling numbers of the second kind, and their relation to partitions of sets. We deduce their algebraic properties and with this how the two kind of Stirling numbers are related. At the end of the chapter, 11 problems are presented.
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
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Basel
About this chapter
Cite this chapter
Soberón, P. (2013). Partitions. In: Problem-Solving Methods in Combinatorics. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-0597-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-0348-0597-1_7
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-0596-4
Online ISBN: 978-3-0348-0597-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)