Young tableaux
Generated by GPT-5-miniExpansion Funnel Raw 59 → Dedup 0 → NER 0 → Enqueued 0
| Young tableaux | |
|---|---|
| Name | Young tableaux |
| Field | Combinatorics; Representation theory; Algebraic geometry |
| Introduced by | Alfred Young |
| Introduced | 1900s |
Young tableaux are combinatorial objects consisting of arrangements of integers into left-justified rows with nonincreasing row lengths, used to encode symmetry, representation-theoretic, and enumerative information. They appear across Combinatorics, Representation theory, Algebraic geometry, Alfred Young's work, and connections to the Symmetric group, General linear group, and symmetric polynomials such as the Schur polynomials. Their study intertwines with algorithms like the Robinson–Schensted correspondence and structures appearing in the work of mathematicians such as Frame, Robinson, Schensted, and Knuth.
Definition and basic examples
A Young tableau is formed by filling a Ferrers diagram (also called a Young diagram) of a partition λ with entries drawn from an ordered alphabet; classic examples include tableaux of shapes corresponding to partitions like (n), (1^n), and (⌊n/2⌋,⌈n/2⌉). Basic finite examples arise when labeling boxes by integers 1 through n to represent standard fillings used in enumerative problems studied by Émile Borel, Frobenius, and Burnside. Graphical instances include the single-row tableau linked to representations of GL_n and the single-column tableau tied to alternating representations studied in the context of Young diagram combinatorics. Examples are used in texts by Richard P. Stanley, William Fulton, and in lecture notes from institutions like Massachusetts Institute of Technology and École Normale Supérieure.
Standard and semistandard tableaux
A standard tableau is a filling of a diagram with the integers 1,…,n each used once with strictly increasing rows and columns; semistandard tableaux relax the condition to weakly increasing rows and strictly increasing columns allowing repeated entries from a finite alphabet, yielding objects central to the study of Schur polynomials and characters of GL_n representations. Standard tableaux enumerate bases for irreducible modules of the Symmetric group (Specht modules studied by G. D. James and M. Broué), while semistandard tableaux index weight vectors in highest-weight representations of GL_n and appear in the theory advanced by H. Weyl and Schur. Key combinatorial properties are developed in works tied to Hook length, Littlewood–Richardson rule, and formulas referenced by scholars at institutions such as Harvard University and Cambridge University.
Hook length formula and enumeration
The hook length formula gives the number of standard tableaux of a partition λ as n! divided by the product of hook lengths associated to each box; this formula is central to enumerative results explored by Frame, Robinson, and Thrall, and later treatments by Richard P. Stanley and William Fulton. Applications include counting standard Young tableaux for shapes tied to combinatorial problems from conferences at Institute for Advanced Study and enumerative results used in proofs by researchers linked to Cambridge University Press publications. Extensions and q-analogues tie to work by Macdonald and intersect with identities studied in contexts connected to Euler and Gauss-style generating functions.
Robinson–Schensted–Knuth correspondence
The Robinson–Schensted–Knuth (RSK) correspondence is a bijection between matrices or permutations and pairs of semistandard tableaux (the P- and Q-tableaux) underpinning profound links among permutations, longest increasing subsequences, and representation theory; foundational contributors include Robinson, Schensted, and Knuth. RSK connects with results in asymptotic representation theory studied by Kerov and Vershik, with probabilistic limits explored in relation to the Tracy–Widom distribution appearing in random matrix theory via work at Princeton University and Courant Institute. Variants include the Greene–Kleitman theorems and generalizations used in combinatorial proofs by researchers affiliated with University of California, Berkeley and University of Cambridge.
Representation-theoretic and symmetric function connections
Tableaux index bases of irreducible representations of GL_n and the Symmetric group via Specht modules and highest-weight theory developed by Frobenius, Schur, and Weyl. Semistandard tableaux realize expansion coefficients of Schur functions in the basis of monomial symmetric functions and encode Littlewood–Richardson coefficients appearing in the decomposition of tensor products, a theory advanced by Littlewood and Richardson. Connections to the Hall–Littlewood polynomials, Macdonald polynomials, and geometric representation theory relate to studies at Institut des Hautes Études Scientifiques and by authors such as I. G. Macdonald and Lusztig.
Algorithms and applications
Algorithms based on insertion and jeu de taquin underpin computational tools for manipulating tableaux and computing structure constants; these procedures were refined by Schützenberger and implemented in computational algebra systems developed at institutions like Symbolic Computation Group. Applications span longest increasing subsequence problems in Erdős–Szekeres-style combinatorics, statistical mechanics models studied by researchers at Princeton University, and optimization problems in algorithmic work by Knuth and collaborators at Stanford University. Recent applications appear in categorical representation theory projects at Harvard University and in enumerative geometry results linked to studies at Institut Mittag-Leffler.