MATH 3151 - Combinatorics

Units: 4
Theory of counting, including partitions, Stirling numbers, generating functions. Applications of Burnside’s lemma from multiple transitivity to the Polya-Redfield Theorem. Ferrers diagrams, symmetric functions, and majorization. Prerequisites: MATH 2101 and either MATH 2150 or MATH 3000 .