Combinatorics

Three credits · Undergraduate

The course covers the principle of inclusion and exclusion; generating functions; recurrence relations; rings and modular arithmetic; finite state machines; group and coding theory; Pólya’s method of enumeration; finite field and combinatorial design; graph theory. Prerequisite: MATH/CSCI 277. Three credits. Offered 2026-2027 and in alternate years.