Combinatorics Algebraic combinatorics Theorem
Littlewood–Richardson rule
Builds on Schur polynomialYoung tableauYoung diagramInteger partition
Statement
Let and be partitions, and let denote the Schur polynomial (in any number of variables, or the Schur function). Then where is the number of Littlewood–Richardson tableaux of shape and content . Such a tableau is a filling of the skew shape with these properties. Here is the set of cells of the Young diagram of that are not in the diagram of .
- The entries weakly increase along rows and strictly increase down columns.
- For each , exactly entries are equal to .
- Read the rows from right to left, from the top row down. In every initial segment of this word, for each , the entry occurs at least as often as .
Remarks
In particular unless the diagram of lies in the diagram of and . The coefficients are symmetric: . Modern proofs use the Robinson–Schensted–Knuth correspondence or Schützenberger's jeu de taquin, which turns each tableau of shape into a straight-shape Young tableau.
Example: take and . For the two cells of are in different rows and columns. The reading word must start with , so the only tableau has in the first row and in the second row. For the two cells form a column filled with above , and the reading word is allowed. For the cells form a row whose reading word fails clause 3. Hence .
Going deeper
For a student
The numbers have several meanings at once. They are the multiplicities in the tensor product of two irreducible polynomial representations of the general linear group. They are the multiplicities of the irreducible representations of in the representation induced from the irreducible representation of indexed by the pair . They are also the structure constants of the cohomology ring of a Grassmannian in the basis of Schubert classes. When is a single row, the rule reduces to Pieri's rule. It says that is the sum of over the obtained by adding cells to , no two in the same column.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Integer partition concept
- Schur polynomial concept
- Young diagram concept
- Young tableau concept
- Littlewood–Richardson rule statement
Further reading
About this page
| Tag | Q490XBH1Q2 |
|---|---|
| URI | m2://Q490XBH1Q2 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 05E05, 05E10, 20C30 |
| Status | This copy of the site has no build data. Run m2 status Q490XBH1Q2. |
| About | Schur polynomial |
| Uses | Schur polynomial, Young tableau, Young diagram, Integer partition |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- 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.