Combinatorics Algebraic combinatorics Concept
Young tableau
Summary
A Young tableau is a Young diagram whose boxes are filled with positive integers, with the entries increasing along rows and down columns. In a standard tableau the entries are , each used once; in a semistandard tableau repetitions are allowed along rows. Tableaux index bases of the irreducible representations of the symmetric group and of the general linear group. They are the combinatorial heart of Schur polynomials, the hook length formula and the Robinson–Schensted correspondence.
Where this leads
5 pages build on this one.
Further reading
About this page
| Tag | Q6TH9PH2R7 |
|---|---|
| URI | m2://Q6TH9PH2R7 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05E10, 05A17 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- 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
Results about this
Used by
- Robinson–Schensted correspondence
- Robinson–Schensted–Knuth correspondence
- Specht module
- Littlewood–Richardson rule
- Hook length formula