Combinatorics.

Catalog description

Elementary counting of sets, lists, multisets, lists without repetition, and partitions. Inclusion-Exclusion Principle with applications to counting certain permutations and functions. The Binomial and Multinomial Theorems, ordinary and exponential generating functions. Proving identities using double counting arguments, averaging, and the Pigeonhole Principle. Solving recurrence relations using different techniques. Applications may include probability, graph theory, additive combinatorics, and Ramsey theory.