Littlewood–Richardson rule

Littlewood–Richardson rule
Name	Littlewood–Richardson rule
Field	Algebraic combinatorics, Representation theory
Named after	John Littlewood, Dudley E. Littlewood, A. R. Richardson

Littlewood–Richardson rule

The Littlewood–Richardson rule gives a combinatorial prescription for computing structure constants that occur in the decomposition of tensor products and products of symmetric functions, connecting tableaux combinatorics with representation theory and geometry. It plays a central role in the study of symmetric groups, general linear groups, Schur functions and cohomology rings of Grassmannians, linking names such as John von Neumann, Hermann Weyl, Élie Cartan, and Claude Chevalley in the development of the surrounding theory. The rule has influenced work by Richard Brauer, Bertram Kostant, and George Lusztig and continues to be used in modern research influenced by Alexander Grothendieck, Michael Atiyah, and Pierre Deligne.

Introduction

The rule arose in the study of characters for GL_n and symmetric group representations, where computations by Issai Schur and Hermann Weyl led to Schur polynomial expansions tied to work of Élie Cartan and Hermann Weyl. Early combinatorial perspectives built on work by Alfred Young and Percy MacMahon, while later structural insights connected to the Schubert calculus of Grassmannians developed by André Weil and Alexander Grothendieck. Influential contributors include John Littlewood, A. R. Richardson, Gian-Carlo Rota, and William Fulton, and the rule is often presented alongside notions introduced by Isaac Newton, David Hilbert, and Emmy Noether in invariant theory.

Statement of the Rule

In its classical form the rule expresses the coefficient c^{λ}_{μ,ν} appearing in the product of Schur functions s_μ s_ν = ∑_λ c^{λ}_{μ,ν} s_λ as the number of Littlewood–Richardson tableaux of shape λ/μ and content ν satisfying a lattice word condition. This combinatorial statement is intimately connected to character multiplicities for irreducible representations of GL_n and branching rules studied by Élie Cartan and Hermann Weyl, and it refines earlier algebraic identities found by Alfred Young and Issai Schur. The coefficients c^{λ}_{μ,ν} also coincide with intersection numbers in the cohomology ring of the Grassmannian, a fact that connects the rule to work by André Weil, Alexander Grothendieck, and Jean-Pierre Serre.

Combinatorial Models and Tableaux Examples

The combinatorial framework uses Young diagrams, Young tableaux, and skew tableaux, foundations laid by Alfred Young and Percy MacMahon and developed by Doron Zeilberger, Richard Stanley, and William Fulton. Examples illustrate how a skew shape λ/μ is filled with entries giving a semistandard tableau whose reading word satisfies the Littlewood–Richardson lattice condition introduced in expositions by Fulton and Richard Stanley. Variants include jeu de taquin slides introduced by Marcel Schützenberger, crystal graphs from Masaki Kashiwara's theory linked to George Lusztig's canonical bases, and Knuth equivalence classes studied with connections to Donald Knuth and Marcel-Paul Schützenberger. Concrete calculations often reference bases of symmetric functions associated to Isaac Newton and James Joseph Sylvester.

Algebraic and Representation-Theoretic Interpretations

Algebraic interpretations identify the coefficients c^{λ}_{μ,ν} with multiplicities in tensor product decompositions of irreducible representations of GL_n and with plethysm problems studied by Richard Brauer and Bertram Kostant. The rule provides structure constants for the ring of symmetric functions studied by Alfred Young and Issai Schur, and it intersects with the representation theory of Symmetric groups originally investigated by Frobenius and Alfred Young. Geometric representation-theoretic perspectives tie the rule to Schubert calculus on Grassmannians and to intersection theory developed by Jean-Pierre Serre and René Thom, while modern categorical frameworks relate to work of Alexander Grothendieck, Maxim Kontsevich, and Joseph Bernstein.

Proofs and Variants

Multiple proofs and extensions exist: the original combinatorial arguments by John Littlewood and A. R. Richardson; bijective and tableau-theoretic proofs by William Fulton and Marcel Schützenberger; geometric proofs via Schubert calculus attributed to André Weil and Alexander Grothendieck; and crystal- and canonical-base approaches influenced by Masaki Kashiwara and George Lusztig. Further variants include the hive model of Knutson and Tao connecting to Horn's problem studied by Alfred Horn, and polyhedral interpretations related to work by Bernd Sturmfels in toric geometry. Generalizations to other Lie types relate to Brylinski and Kostant, and to branching rules elaborated by Harish-Chandra and Roger Howe.

Applications and Consequences

The rule's applications span decomposition of tensor products for GL_n, calculation of intersection numbers in the cohomology of Grassmannians, and computation of structure constants in the ring of symmetric functions used by Issai Schur. It informs Horn-type eigenvalue inequalities studied by Alfred Horn and Allen Knutson, and underpins algorithms and software implementations influenced by Richard Stanley and Dominique Foata. In mathematical physics, connections appear in the study of quantum groups and canonical bases explored by George Lusztig and in gauge-theory inspired enumerative problems linked to Edward Witten. The rule also guides research in algebraic combinatorics involving Gian-Carlo Rota, Richard Stanley, and Zelevinsky's cluster algebra program.

Category:Algebraic combinatorics Category:Representation theory Category:Schubert calculus