MATH 620 Combinatorial Analysis

This course is an introduction to combinatorics: a branch of mathematics that studies the existence, enumeration, analysis, and optimization of discrete structures that satisfy certain properties. Topics include counting distributions and colorings, sieve methods, generating functions, permutation spaces, partially ordered sets, Ramsey theory, and matching theory, with applications to computational problems.

3 Credit(s)