Mathematics Logo

Combinatorics

Combinatorics involves the general study of discrete objects. Reasoning about such objects occurs throughout mathematics and science. For example, major biological problems involving decoding the genome and phylogenetic trees are largely combinatorial. Researchers in quantum gravity have developed deep combinatorial methods to evaluate integrals, and many problems in statistical mechanics are discretized into combinatorial problems. Three of the four 2006 Fields Medals were awarded for work closely related to combinatorics: Okounkov's work on random matrices and Kontsevich's conjecture, Tao's work on primes in arithmetic progression, and Werner's work on percolation.

Our department has been on the leading edge of combinatorics for the last forty years. The late Gian-Carlo Rota is regarded as the founding father of modern enumerative/algebraic combinatorics, transforming it from a bag of ad hoc tricks to a deep, unified subject with important connections to other areas of mathematics. Our department has been the nexus for developing connections between combinatorics, commutative algebra, algebraic geometry, and representation theory that have led to the solution of major long-standing problems. We are also a leader in extremal, probabilistic, and algorithmic combinatorics, which have close ties to other areas including computer science.

Faculty

Daniel Kleitman

Elchanan Mossel

Alex Postnikov

Richard Stanley

Yufei Zhao