Young diagrams

Young diagrams
Name	Young diagrams
Field	Algebraic combinatorics, Representation theory, Algebraic geometry
Introduced by	Alfred Young
Year	1900
Related	Young tableau, Schur function, Symmetric group, Partition (number theory)

Young diagrams

Young diagrams are combinatorial diagrams encoding integer partitions and organizing structural information in representation theory and algebraic combinatorics. They provide a graphical language used in the study of symmetric group representations, Schur polynomial expansions, and geometry of Grassmannians and flag varietys. Originating with Alfred Young around 1900, these diagrams link classical problems studied by figures such as Frobenius, Littlewood, Richardson, Schur, and Hooke into a unified combinatorial framework.

Definition and basic properties

A Young diagram is a left-justified array of boxes whose row lengths form a nonincreasing sequence of nonnegative integers describing a partition. The diagrammatic convention connects to tableaux studied by Alfred Young and later formalized by Frobenius and Schur. Key properties include conjugation (transpose) relating rows and columns, dominance order comparing partitions, and the bijection with Ferrers-style representations used by Euler and MacMahon. Operations on diagrams—adding or removing boxes—model branching rules in the representation theory of symmetric groups and affect combinatorial invariants studied by Littlewood and Richardson.

Partition notation and Ferrers diagrams

Partitions are usually written in decreasing sequence λ = (λ1, λ2, ..., λk) and visualized by the corresponding diagram; the conjugate partition λ' is obtained by reflecting across the main diagonal. Ferrers diagrams, introduced in the work of John Ferrers and popularized in enumerative studies by Hardy and Ramanujan, use dots instead of boxes but encode identical information. Notations such as Young frames and French versus English conventions arose in expositions by Macdonald, Stanley, and Sagan, while analytic partition identities were pursued by Rademacher and Wright.

Hook length formula and combinatorial identities

The hook length formula gives the number of standard Young tableaux of a given shape λ as n! divided by the product of hook lengths of all boxes; this result traces to combinatorial work of Frame, Robinson, and Thrall and connects to determinant evaluations used by Jacobi and Cauchy. Hook length computations underpin counting results linked with the Robinson–Schensted–Knuth correspondence and identities by Hooke-style combinatorialists. Related combinatorial identities include the hook content formula for semi-standard counts appearing in studies by Schur and symmetry results exploited by Weyl in character formulas.

Representations of symmetric groups and Specht modules

Young diagrams index irreducible representations of the symmetric group Sn over characteristic zero via Specht modules constructed from polytabloid relations named after W. Specht and developed in the classical program of Frobenius and Schur. The diagram shape λ corresponds to the irreducible character χ^λ and branching rules for restriction from Sn to Sn−1 are governed by box-removal operations studied by Young and refined by Littlewood and Richardson. Modular representation theory for fields of positive characteristic invokes James and Kleshchev, while connections to Hecke algebras and Kazhdan–Lusztig theory were advanced by Iwahori, Hecke, Kazhdan, and Lusztig.

Young tableaux: standard and semistandard

Standard Young tableaux are fillings of a Young diagram with numbers 1..n increasing along rows and columns; semistandard tableaux permit weak row-increase and strict column-increase with entries from an ordered alphabet. These tableau classes are central to the Robinson–Schensted correspondence linking permutations and pairs of standard tableaux as studied by Schensted and Robinson, and to the theory of Schur function expansions in works by Littlewood and Richardson. Tableaux combinatorics informs crystal bases in the representation theory of Lie algebras such as those considered by Kashiwara and Lusztig, and appears in bijective proofs by Stanton, White, and Fomin.

Applications in algebraic combinatorics and geometry

Young diagrams and associated tableaux appear across algebraic combinatorics and geometry: they index Schubert classes on Grassmannians and flag varietys via the Schubert calculus developed by Schubert and formalized by Bott and Samelson; describe eigenfunctions in the theory of symmetric functions by Macdonald; and organize eigenvalue distributions in random matrix considerations by Tracy and Widom. Further applications include the study of cohomology rings of Grassmannians via Littlewood–Richardson rules explored by Belkale and Witten, connections to geometric representation theory advanced by Beilinson, Bernstein, and Deligne, and computational implementations in algebra systems influenced by work at institutions such as American Mathematical Society-supported projects and research groups at Institut Henri Poincaré.

Category:Combinatorics