MA 374 - Combinatorics
- Credit Hours: 4R-0L-4C
- Term Available: F, W, S
- Graduate Studies Eligible: No
- Prerequisites: MA 221
- Corequisites: None
A first course in combinatorics. Basic counting principles, permutations, combinations. Combinatorial proof. The pigeonhole principle. The principle of inclusion/exclusion. Generating functions. Recurrence relations. Additional topics in combinatorics, which may include permutation groups and Burnside's Lemma, Polya enumeration, multivariate generating functions, combinatorial designs, Ramsey theory, order relations, or other topics at the discretion of the instructor.