Math 2.0

Combinatorics Algebraic combinatorics Theorem

Littlewood–Richardson rule

Builds on Schur polynomialYoung tableauYoung diagramInteger partition

Statement

Let λ\lambda and μ\mu be partitions, and let sλs_\lambda denote the Schur polynomial (in any number of variables, or the Schur function). Then sλ sμ=∑νcλμν sν,s_\lambda \, s_\mu = \sum_{\nu} c^{\nu}_{\lambda \mu} \, s_\nu, where cλμνc^{\nu}_{\lambda\mu} is the number of Littlewood–Richardson tableaux of shape ν/λ\nu / \lambda and content μ\mu. Such a tableau is a filling TT of the skew shape ν/λ\nu / \lambda with these properties. Here ν/λ\nu / \lambda is the set of cells of the Young diagram of ν\nu that are not in the diagram of λ\lambda.

  1. The entries weakly increase along rows and strictly increase down columns.
  2. For each kk, exactly μk\mu_k entries are equal to kk.
  3. Read the rows from right to left, from the top row down. In every initial segment of this word, for each k≥1k \ge 1, the entry kk occurs at least as often as k+1k+1.

Remarks

In particular cλμν=0c^{\nu}_{\lambda\mu} = 0 unless the diagram of λ\lambda lies in the diagram of ν\nu and ∣ν∣=∣λ∣+∣μ∣\abs{\nu} = \abs{\lambda} + \abs{\mu}. The coefficients are symmetric: cλμν=cμλνc^{\nu}_{\lambda\mu} = c^{\nu}_{\mu\lambda}. Modern proofs use the Robinson–Schensted–Knuth correspondence or Schützenberger's jeu de taquin, which turns each tableau of shape ν/λ\nu/\lambda into a straight-shape Young tableau.

Example: take λ=(1)\lambda = (1) and μ=(1,1)\mu = (1, 1). For ν=(2,1)\nu = (2, 1) the two cells of ν/λ\nu / \lambda are in different rows and columns. The reading word must start with 11, so the only tableau has 11 in the first row and 22 in the second row. For ν=(1,1,1)\nu = (1, 1, 1) the two cells form a column filled with 11 above 22, and the reading word 1 21\,2 is allowed. For ν=(3)\nu = (3) the cells form a row 1 21\,2 whose reading word 2 12\,1 fails clause 3. Hence s(1)s(1,1)=s(2,1)+s(1,1,1)s_{(1)} s_{(1,1)} = s_{(2,1)} + s_{(1,1,1)}.

Going deeper

For a student

The numbers cλμνc^\nu_{\lambda\mu} 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 S∣ν∣S_{\abs\nu} in the representation induced from the irreducible representation of S∣λ∣×S∣μ∣S_{\abs\lambda} \times S_{\abs\mu} indexed by the pair (λ,μ)(\lambda, \mu). They are also the structure constants of the cohomology ring of a Grassmannian in the basis of Schubert classes. When μ=(k)\mu = (k) is a single row, the rule reduces to Pieri's rule. It says that sλs(k)s_\lambda s_{(k)} is the sum of sνs_\nu over the ν\nu obtained by adding kk cells to λ\lambda, 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Integer partition concept
  2. Schur polynomial concept
  3. Young diagram concept
  4. Young tableau concept
  5. Littlewood–Richardson rule statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Littlewood%E2%80%93Richardson_rule
About this page
TagQ490XBH1Q2
URIm2://Q490XBH1Q2
Kindstatement, theorem
WritingW0 stub
MSC05E05, 05E10, 20C30
StatusThis copy of the site has no build data. Run m2 status Q490XBH1Q2.
AboutSchur polynomial
UsesSchur polynomial, Young tableau, Young diagram, Integer partition
Same as
Changed2 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.