Young tableau

Young tableau
Name	Young tableau
Field	Mathematics
Introduced	1900s
Related	Representation theory; Symmetric group; Schur functions

Young tableau

A Young tableau is a combinatorial array introduced in the early 20th century used to encode partitions and to control bases in representation theory and algebraic combinatorics. Developed in the work of Alfred Young, employed later by figures connected to Frobenius, Schur, Weyl, the notion organizes integers into diagrams that interact tightly with structures such as the symmetric group, general linear group, and the theory of symmetric functions. It serves as a bridge between counting problems, insertion algorithms, and the classification of irreducible representations for classical groups.

Definition and Basic Concepts

A Young tableau is built from a Young diagram associated to a partition; cells are filled according to specified rules. The diagram describes a Ferrers shape tied to partitions studied by Euler and Ramanujan in enumerative contexts; the tableau fillings are constrained by row and column conditions that reflect combinatorial conditions arising in the representation theory of Frobenius, Schur, and Weyl. Basic examples appear in classical treatments by Littlewood and Richardson and are central in expositions by Macdonald and Stanley.

Standard and Semistandard Young Tableaux

Two main classes are standard tableaux and semistandard tableaux. Standard tableaux place the integers 1..n each exactly once with strictly increasing rows and columns; semistandard tableaux allow weakly increasing rows and strictly increasing columns with entries from an ordered alphabet often indexed by natural numbers or weights appearing in Weyl modules. Standard tableaux index bases for irreducible representations of the symmetric group via the Young symmetrizer construction developed by Frobenius and Young, while semistandard tableaux index weight bases for polynomial representations of GL_n and enter character formulae of Schur type used by Littlewood and Richardson.

Algorithms and Constructions (Robinson–Schensted, Jeu de taquin)

Insertion and sliding algorithms provide bijections and structural insight. The Robinson–Schensted correspondence, refined in work by Robinson and Schensted and later generalized by Knuth, pairs permutations with pairs of standard tableaux of the same shape, linking the symmetric group to tableau combinatorics and giving combinatorial proofs for identities in the representation theory of Schur and Frobenius. Jeu de taquin, introduced by Schützenberger, describes sliding moves that relate skew tableaux and yield the Littlewood–Richardson rule proved and used by Littlewood and Richardson in decomposing tensor products for GL_n. Variants and crystal interpretations were developed further by researchers connected to Kashiwara and Lusztig in the study of canonical bases for quantum groups.

Representation-Theoretic and Symmetric Function Connections

Tableaux appear as combinatorial parametrizations of irreducible representations and characters. Standard tableaux index Specht modules for the symmetric group via constructions of Frobenius and Young, while semistandard tableaux realize bases for polynomial representations of GL_n whose characters are Schur functions introduced by Schur and studied extensively by Macdonald, Weyl, and Littlewood. The Littlewood–Richardson rule, engaged by Littlewood and Richardson and algorithmically implemented via jeu de taquin or lattice word formulations, computes structure constants for products of Schur functions and thereby tensor product multiplicities for GL_n representations. Crystals and crystal graphs formulated by Kashiwara connect tableaux to representations of quantum enveloping algebras studied by Drinfeld and Jimbo.

Enumerative Results and Hook-Length Formula

Counting tableaux yields deep enumerative formulae. The hook-length formula, first proved in modern form by Frame, Robinson, and Thrall, gives the number of standard tableaux of a given shape as n! divided by the product of hook-lengths associated to cells of the diagram; this result links classical factorial enumerations to partition combinatorics studied by Hardy and Ramanujan. Generalizations include formulae for semistandard counts expressed via hook-content formulas used by Stanley and identities in symmetric function theory developed by Macdonald. Asymptotic results on random tableaux relate to limit shape phenomena explored in probabilistic combinatorics by researchers associated with Vershik and Kerov.

Generalizations and Variants

Numerous extensions of the tableau concept appear across mathematics. Skew tableaux, shifted tableaux, and domino tableaux arise in connections to projective representations investigated by Schur and Weyl; shifted tableaux feature in the theory of Schur P- and Q-functions treated by Stembridge and Sagan. Crystal tableaux and Littelmann paths developed by Littelmann generalize character combinatorics to other Lie types studied by Cartan and Dynkin. Other variants, including increasing tableaux and plane partitions, interface with topics addressed by MacMahon and by modern work relating to the Riemann–Hilbert correspondence and algebraic geometry pursued in settings involving Grothendieck and Nakajima.

Category:Combinatorics