Combinatorics

Basic counting principles: permutations, combinations, probability, occupancy problems, and binomial coefficients. More sophisticated methods include generating functions, recurrence relations, inclusion/exclusion principle, and the pigeonhole principle. Additional topics include asymptotic enumeration, Polya counting theory, combinatorial designs, coding theory, and combinatorial optimization.

Prerequisites:
http://bulletin.uga.edu/CoursesHome.aspx

Semester Offered: 
Fall
Course Information File: