Contents
Chapter 1: Basic Counting Methods
1.1 The multiplication principle
1.4 Binomial coefficient identities
1.6 The principle of inclusion and exclusion
1.8 Linear recurrence relations
1.9 Special recurrence relations
1.10 Counting and number theory
Chapter 2: Generating Functions
2.1 Rational generating functions
2.2 Special generating functions
2.4 Labeled and unlabeled sets
2.9 Symmetries in domain and range
Chapter 3: The Pigeonhole Principle
3.2 The lattice point problem and SET®
3.5 Sequences and partial orders
4.2 Generalizations of Ramsey’s theorem
4.3 Ramsey numbers, bounds, and asymptotics
Chapter 5: Error-Correcting Codes
Chapter 6: Combinatorial Designs
6.7 The Golay code and S(5, 8, 24)
18.223.206.225