Enumerative Combinatorics

3 Credits

Advanced study of enumerative combinatorics. Covers bijective, algebraic, and generating function methods for counting discrete structures. Topics include partially ordered sets and Möbius inversion, lattice theory, rational, algebraic, and D-finite generating functions, exponential structures, Lagrange inversion, tree enumeration, and applications such as the Matrix-tree theorem.