In mathematics, a Young tableau (; plural: tableaux) is a combinatorial object useful in representation theory and Schubert calculus. It provides a convenient way to describe the group representations of the symmetric and general linear groups and to study their properties. Young tableaux were introduced by Alfred Young, a mathematician at Cambridge University, in 1900. They were then applied to the study of the symmetric group by Georg Frobenius in 1903. Their theory was further developed by many mathematicians, including Percy MacMahon, W. V. D. Hodge, G. de B. Robinson, Gian-Carlo Rota, Alain Lascoux, Marcel-Paul Schützenberger and Richard P. Stanley.
.Note: this article uses the English convention for displaying Young diagrams and tableaux
A Young diagram (also called a Ferrers diagram, particularly when represented using dots) is a finite collection of boxes, or cells, arranged in left-justified rows, with the row lengths in non-increasing order. Listing the number of boxes in each row gives a partition λ of a non-negative integer n, the total number of boxes of the diagram. The Young diagram is said to be of shape λ, and it carries the same information as that partition. Containment of one Young diagram in another defines a partial ordering on the set of all partitions, which is in fact a lattice structure, known as Young's lattice. Listing the number of boxes of a Young diagram in each column gives another partition, the conjugate or transpose partition of λ; one obtains a Young diagram of that shape by reflecting the original diagram along its main diagonal.
There is almost universal agreement that in labeling boxes of Young diagrams by pairs of integers, the first index selects the row of the diagram, and the second index selects the box within the row. Nevertheless, two distinct conventions exist to display these diagrams, and consequently tableaux: the first places each row below the previous one, the second stacks each row on top of the previous one. Since the former convention is mainly used by Anglophones while the latter is often preferred by Francophones, it is customary to refer to these conventions respectively as the English notation and the French notation; for instance, in his book on symmetric functions, Macdonald advises readers preferring the French convention to "read this book upside down in a mirror" (Macdonald 1979, p. 2). This nomenclature probably started out as jocular. The English notation corresponds to the one universally used for matrices, while the French notation is closer to the convention of Cartesian coordinates; however, French notation differs from that convention by placing the vertical coordinate first. The figure on the right shows, using the English notation, the Young diagram corresponding to the partition (5, 4, 1) of the number 10. The conjugate partition, measuring the column lengths, is (3, 2, 2, 2, 1).
In many applications, for example when defining Jack functions, it is convenient to define the arm length aλ(s) of a box s as the number of boxes to the right of s in the diagram λ in English notation. Similarly, the leg length lλ(s) is the number of boxes below s. The hook length of a box s is the number of boxes to the right of s or below s in English notation, including the box s itself; in other words, the hook length is aλ(s) + lλ(s) + 1.
A Young tableau is obtained by filling in the boxes of the Young diagram with symbols taken from some alphabet, which is usually required to be a totally ordered set. Originally that alphabet was a set of indexed variables x1, x2, x3..., but now one usually uses a set of numbers for brevity. In their original application to representations of the symmetric group, Young tableaux have n distinct entries, arbitrarily assigned to boxes of the diagram. A tableau is called standard if the entries in each row and each column are increasing. The number of distinct standard Young tableaux on n entries is given by the involution numbers
In other applications, it is natural to allow the same number to appear more than once (or not at all) in a tableau. A tableau is called semistandard, or column strict, if the entries weakly increase along each row and strictly increase down each column. Recording the number of times each number appears in a tableau gives a sequence known as the weight of the tableau. Thus the standard Young tableaux are precisely the semistandard tableaux of weight (1,1,...,1), which requires every integer up to n to occur exactly once.
There are several variations of this definition: for example, in a row-strict tableau the entries strictly increase along the rows and weakly increase down the columns. Also, tableaux with decreasing entries have been considered, notably, in the theory of plane partitions. There are also generalizations such as domino tableaux or ribbon tableaux, in which several boxes may be grouped together before assigning entries to them.
A skew shape is a pair of partitions (λ, μ) such that the Young diagram of λ contains the Young diagram of μ; it is denoted by λ/μ. If λ = (λ1, λ2, ...) and μ = (μ1, μ2, ...), then the containment of diagrams means that μi ≤ λi for all i. The skew diagram of a skew shape λ/μ is the set-theoretic difference of the Young diagrams of λ and μ: the set of squares that belong to the diagram of λ but not to that of μ. A skew tableau of shape λ/μ is obtained by filling the squares of the corresponding skew diagram; such a tableau is semistandard if entries increase weakly along each row, and increase strictly down each column, and it is standard if moreover all numbers from 1 to the number of squares of the skew diagram occur exactly once. While the map from partitions to their Young diagrams is injective, this is not the case from the map from skew shapes to skew diagrams; therefore the shape of a skew diagram cannot always be determined from the set of filled squares only. Although many properties of skew tableaux only depend on the filled squares, some operations defined on them do require explicit knowledge of λ and μ, so it is important that skew tableaux do record this information: two distinct skew tableaux may differ only in their shape, while they occupy the same set of squares, each filled with the same entries. Young tableaux can be identified with skew tableaux in which μ is the empty partition (0) (the unique partition of 0).
Any skew semistandard tableau T of shape λ/μ with positive integer entries gives rise to a sequence of partitions (or Young diagrams), by starting with μ, and taking for the partition i places further in the sequence the one whose diagram is obtained from that of μ by adding all the boxes that contain a value ≤ i in T; this partition eventually becomes equal to λ. Any pair of successive shapes in such a sequence is a skew shape whose diagram contains at most one box in each column; such shapes are called horizontal strips. This sequence of partitions completely determines T, and it is in fact possible to define (skew) semistandard tableaux as such sequences, as is done by Macdonald (Macdonald 1979, p. 4). This definition incorporates the partitions λ and μ in the data comprising the skew tableau.
Young tableaux have numerous applications in combinatorics, representation theory, and algebraic geometry. Various ways of counting Young tableaux have been explored and lead to the definition of and identities for Schur functions.
Many combinatorial algorithms on tableaux are known, including Schützenberger's jeu de taquin and the Robinson–Schensted–Knuth correspondence. Lascoux and Schützenberger studied an associative product on the set of all semistandard Young tableaux, giving it the structure called the plactic monoid (French: le monoïde plaxique).
Applications to algebraic geometry center around Schubert calculus on Grassmannians and flag varieties. Certain important cohomology classes can be represented by Schubert polynomials and described in terms of Young tableaux.
Young diagrams are in one-to-one correspondence with irreducible representations of the symmetric group over the complex numbers. They provide a convenient way of specifying the Young symmetrizers from which the irreducible representations are built. Many facts about a representation can be deduced from the corresponding diagram. Below, we describe two examples: determining the dimension of a representation and restricted representations. In both cases, we will see that some properties of a representation can be determined by using just its diagram.
Young diagrams also parametrize the irreducible polynomial representations of the general linear group GLn (when they have at most n nonempty rows), or the irreducible representations of the special linear group SLn (when they have at most n − 1 nonempty rows), or the irreducible complex representations of the special unitary group SUn (again when they have at most n − 1 nonempty rows). In these cases semistandard tableaux with entries up to n play a central role, rather than standard tableaux; in particular it is the number of those tableaux that determines the dimension of the representation.
The dimension of the irreducible representation πλ of the symmetric group Sn corresponding to a partition λ of n is equal to the number of different standard Young tableaux that can be obtained from the diagram of the representation. This number can be calculated by the hook length formula.
A hook length hook(x) of a box x in Young diagram Y(λ) of shape λ is the number of boxes that are in the same row to the right of it plus those boxes in the same column below it, plus one (for the box itself). By the hook-length formula, the dimension of an irreducible representation is n! divided by the product of the hook lengths of all boxes in the diagram of the representation:
The figure on the right shows hook-lengths for all boxes in the diagram of the partition 10 = 5 + 4 + 1. Thus
Similarly, the dimension of the irreducible representation W(λ) of GLr corresponding to the partition λ of n (with at most r parts) is the number of semistandard Young tableaux of shape λ (containing only the entries from 1 to r), which is given by the hook-length formula:
where the index i gives the row and j the column of a box. For instance, for the partition (5,4,1) we get as dimension of the corresponding irreducible representation of GL7 (traversing the boxes by rows):
A representation of the symmetric group on n elements, Sn is also a representation of the symmetric group on n − 1 elements, Sn−1. However, an irreducible representation of Sn may not be irreducible for Sn−1. Instead, it may be a direct sum of several representations that are irreducible for Sn−1. These representations are then called the factors of the restricted representation (see also induced representation).
The question of determining this decomposition of the restricted representation of a given irreducible representation of Sn, corresponding to a partition λ of n, is answered as follows. One forms the set of all Young diagrams that can be obtained from the diagram of shape λ by removing just one box (which must be at the end both of its row and of its column); the restricted representation then decomposes as a direct sum of the irreducible representations of Sn−1 corresponding to those diagrams, each occurring exactly once in the sum.