Young tableau
Builds on Young diagramInteger partition
Definition
Let be a partition of . Let be its Young diagram, the set of cells with and , where is the row and the column.
- A Young tableau of shape is a map , called a filling of .
- is semistandard if and whenever both cells lie in . So entries weakly increase along rows and strictly increase down columns.
- is standard if it is semistandard and is a bijection from onto .
Remarks
Example: for , the filling with rows and is standard. Each row increases (, ), each column increases (, ), and each of appears once. The filling with rows and is semistandard but not standard, because appears twice.
Non-example: the filling of shape with first row and second row is not semistandard, because the first row decreases.
Many authors say "tableau" for a semistandard tableau. The content of a semistandard tableau is the sequence , where is the number of entries equal to . The number of standard tableaux of shape is given by the hook length formula.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Integer partition concept
- Young diagram concept
- Young tableau definition
Further reading
About this page
| Tag | 287JS93ZDS |
|---|---|
| URI | m2://287JS93ZDS |
| Kind | definition |
| Writing | W0 stub |
| MSC | 05E10, 05A17 |
| Defines | Young tableau |
| Uses | Young diagram, Integer partition |
| 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
No page links to this page yet.