Skip to main content

Enumerative Combinatorics

An introduction to the basic notions and techniques in enumerative combinatorics. The material has applications to polytopal theory, hyperplane arrangements, computational commutative algebra, representation theory and symrnetric functions. Topics include generating functions, the principle of inclusion and exclusion, bijections, recurrence relations, partially ordered sets, the Mobius function and Mobius algebra, the Lagrange inversion formula, the exponential formula and tree enumeration.

Prefix:
MA
Course Number:
614
Semester:
Spring 2017
Year:
2017030
Credits:
3.0