Abstract
This chapter contains foundational combinatorial results. It covers basic abstract counting techniques and gives a detailed description of permutations of finite sets, relating them to Japanese ladders. It concludes with a description of generating functions, and how they are used to count objects.
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
Corresponding author
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Dougherty, S.T. (2020). Foundational Combinatorial Structures. In: Combinatorics and Finite Geometry. Springer Undergraduate Mathematics Series. Springer, Cham. https://doi.org/10.1007/978-3-030-56395-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-56395-0_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-56394-3
Online ISBN: 978-3-030-56395-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)