Combinatorics.

Catalog description

Students examine permutations, combinations, Stirling numbers, Bell numbers, Catalan numbers, combinatorial proofs, the principle of inclusion-exclusion, the binomial theorem, integer partitions, recurrence relations, and generating functions. Additional topics may include graph theory, poset theory, matroid theory, computational complexity, Burnside's lemma, Ramsey numbers, and error-correcting codes. Prerequisite: C or better in Math 3300.