Skip to main content
Skip to main menu

Slideshow

MATH(CSCI) 4670/6670

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.

Credit Hours:
3
Prerequisites:
MATH 3000 or MATH 3500 or MATH 3500H) and (CSCI(MATH) 2610 or MATH 3200

Support us

We appreciate your financial support. Your gift is important to us and helps support critical opportunities for students and faculty alike, including lectures, travel support, and any number of educational events that augment the classroom experience. Click here to learn more about giving.

Every dollar given has a direct impact upon our students and faculty.