Young Diagrams and Tableaux

Core Idea

A Young diagram is a graphical representation of a partition λ = (λ₁ ≥ λ₂ ≥ ··· ≥ λₖ) as left-justified rows of boxes. A Young tableau fills these boxes with numbers according to specified rules. Standard Young tableaux (entries increase along rows and down columns) count the dimension of the corresponding Specht module, while semistandard tableaux arise in the theory of symmetric functions and Schur-Weyl duality.

Explainer

A Young diagram of a partition λ = (λ₁, λ₂, …, λₖ) is an array of boxes arranged in left-justified rows, with λᵢ boxes in row i. For example, the partition (3, 2, 1) of 6 gives a staircase pattern: 3 boxes on top, 2 in the middle, 1 on the bottom. The visual language of Young diagrams translates partition arithmetic into geometry, making combinatorial arguments intuitive.

A Young tableau fills the boxes of a Young diagram with entries (typically positive integers). A standard Young tableau (SYT) uses each of the numbers 1, …, n exactly once, with entries increasing left-to-right along each row and top-to-bottom down each column. The number of SYTs of shape λ equals the dimension of the Specht module Sλ, and is computed by the hook length formula: f^λ = n! / ∏ h(i,j), where h(i,j) is the hook length of box (i,j) — the number of boxes directly to its right plus those directly below it plus one (for the box itself). This formula, discovered by Frame, Robinson, and Thrall, is a remarkable combinatorial identity.

The construction of Specht modules uses tableaux directly. Given a Young tableau T of shape λ, define the row symmetrizer a_T = Σ_{σ∈R(T)} σ (sum over permutations preserving each row) and the column antisymmetrizer b_T = Σ_{σ∈C(T)} sgn(σ)·σ (signed sum over permutations preserving each column). The Young symmetrizer is c_T = a_T · b_T, an element of the group algebra ℂ[Sₙ]. The left ideal ℂ[Sₙ]·c_T is isomorphic to the Specht module Sλ — an explicit construction of the irreducible representation from combinatorial data.

Semistandard Young tableaux (SSYTs) relax the conditions: entries weakly increase along rows and strictly increase down columns, and entries can repeat. SSYTs of shape λ with entries in {1, …, m} index a basis for the irreducible polynomial representation of GL_m corresponding to λ, and their generating function is the Schur polynomial s_λ(x₁, …, x_m). This dual role — standard tableaux for Sₙ, semistandard for GL_m — is the combinatorial manifestation of Schur-Weyl duality, and it places Young diagrams at the intersection of representation theory, algebraic combinatorics, and symmetric function theory.