Enumerative Combinatorics
A 23-module path through enumerative combinatorics, in study order from foundations to the frontier.
Modules
- The Sum and Product Rules
- Permutations
- Combinations
- The Binomial Theorem
- Binomial Coefficient Identities
- Combinations with Repetition
- The Pigeonhole Principle
- Applications of the Pigeonhole Principle
- The Principle of Inclusion-Exclusion
- Derangements
- Counting Surjections
- Recurrence Relations
- Solving Linear Recurrences
- Ordinary Generating Functions
- Solving Recurrences with Generating Functions
- Exponential Generating Functions
- Catalan Numbers
- Stirling Numbers of the Second Kind
- Stirling Numbers of the First Kind
- Bell Numbers
- Partitions of Integers
- The Twelvefold Way
- Introduction to Polya Enumeration