Combinatorial Analysis I. (3 h)

Enumeration techniques, generating functions, recurrence formulas, the principle of inclusion and exclusion, Polya theory, graph theory, combinatorial algorithms, partially ordered sets, designs, Ramsey theory, symmetric functions, and Schur functions. P- MTH 117 or prerequisite override required.