Algebraic combinatorics
Definition
Algebraic combinatorics is the branch of mathematics with two complementary aims:
- to solve problems of combinatorics with tools of abstract algebra, such as groups, group actions, rings, linear algebra and representation theory;
- to describe algebraic objects, such as bases, structure constants, characters and dimensions, by combinatorial rules that count explicit finite structures.
Remarks
Example of aim 1: the number of orbits of a group acting on colourings is computed by Burnside's lemma and the Pólya enumeration theorem. Example of aim 2: the product of two Schur polynomials is a sum of Schur polynomials. The Littlewood–Richardson rule gives the coefficients as numbers of certain tableaux.
Non-example: a proof that a graph with a property exists, by showing that a random graph has it with positive probability, meets neither aim. It belongs to the probabilistic method.
The main objects include symmetric functions, Young tableaux, association schemes and incidence algebras of posets.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Combinatorics concept
- Group action concept
- Symmetric function concept
- Algebraic combinatorics definition
Further reading
About this page
| Tag | 5VDCJTZ8SW |
|---|---|
| URI | m2://5VDCJTZ8SW |
| Kind | definition |
| Writing | W0 stub |
| MSC | 05E99, 05E05, 05E10 |
| Defines | Algebraic combinatorics |
| Uses | Combinatorics, Group action, Symmetric function |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.