Algebraic Combinatorics

Combinatorial structures arising from algebra: symmetric functions, posets, root systems.

foundation tier

Algebraic Combinatorics. Combinatorial structures arising from algebra: symmetric functions, posets, root systems.

Foundations and canonical references

The standard treatments of algebraic combinatorics approach the subject from complementary angles. Stanley, Algebraic Combinatorics (2013) is the anchor reference for the subject and lays out the core definitions, theorems, and worked examples that practitioners return to. Stanley, Enumerative Combinatorics, Volume 2 (1999) gives a parallel, more proof-oriented exposition of the same material and is widely used as a graduate text.

Open methodological questions for algebraic combinatorics include sharpening the bridges between foundational theory and computational practice, extending classical results to broader or more structured settings, and integrating the techniques surveyed above with adjacent mathematical disciplines. The references listed in this page are the entry points that current work builds on.

Prerequisites

Sources

  • textbook · primary · 2013
    Algebraic Combinatorics
    stanley-2013
  • textbook · primary · 1999
    Enumerative Combinatorics, Volume 2
    stanley-1999

In context

Where this topic sits in the prerequisite graph. Click any node to jump.

Open in full atlas →

Explore

  1. 01

    Symmetric Functions

    Schur, Hall–Littlewood, and Macdonald polynomials.
  2. 02

    Poset Theory

    Möbius functions, lattice theory, and the order complex.
  3. 03

    Cluster Algebras

    Fomin–Zelevinsky cluster algebras and their categorifications.

Review this topic

This page was drafted by an agent and is waiting on expert review. Spotted a wrong prerequisite, a missing concept, a misattributed source, or a factual slip? Tell us — your review opens a tracked issue maintainers act on.