Combinatorics

Prerequisite: Admission to the MS program in Mathematics or consent of instructor This is an introductory course in graduate-level combinatorics. Various techniques for enumerating sets and objects will be covered. Topics include permutations, sets and multisets, partitions, sieve methods, generating functions, partially ordered sets and Mobius inversion. Additional topics may be included depending on time and student interest, including possibly recurrence relations, distributive lattices, graph theory and Ramsey theory. Offered alternate years.