MATH 6460 - Combinatorics

This course is divided into two parts. The first part gives a gentle introduction to the subject and covers basic counting techniques (including the inclusion-exclusion principle), recurrence relations and generating functions, and discrete probability with the basic probabilistic method. The second part deals with more challenging topics such as combinatorial designs (including Steiner systems), posets (including the Möbius function), enumeration under group action, and extremal set theory (including Sperner’s and intersecting families, and the Littlewood-Offord problem).

Note: Open to graduate students only.

Credits: 3 hours

Restrictions: Restricted to master’s and doctoral students in computational mathematics, mathematics education, collegiate math education, or mathematics.