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. Offered fall semester of every even-numbered year. Credit Hours: 3 Prerequisites: MATH 3000 or MATH 3300 or MATH 3500 or MATH 3500H or CSCI (MATH) 2610 or MATH 3200 Semester Offered: Fall Level: Graduate Undergraduate Course Information File: CIS_CSCI_4670.pdf (188.87 KB)
