Added to Favorites

Popular Searches

Definitions

In mathematics, a Young tableau (pl.: tableaux) is a combinatorial object useful in representation theory. 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 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.
## Definitions

### Diagrams

### Tableaux

### Variations

### Skew tableaux

## Overview of applications

## Applications in representation theory

### Dimension of a representation

Hook lengths### Restricted representations

## See also

## References

Note: this article uses the English convention for displaying Young diagrams and tableaux.

A Young diagram (also called Ferrers diagram) is a finite collection of boxes, or cells, arranged in left-justified rows, with the row sizes weakly decreasing (each row has the same or shorter length than its predecessor). Listing the number of boxes in each row gives a partition $lambda$ of a positive integer n, the total number of boxes of the diagram. The Young diagram is said to be of shape $lambda$, and it carries the same information as that partition. Listing the number of boxes in each column gives another partition, the conjugate or transpose partition of $lambda$; 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. This nomenclature probably started out as a joke: 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). The English notation corresponds to the one universally used for matrices, while the French notation is closer to the convention of Cartesian coordinates; note however that 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).

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 used to be a set of indexed variables x_{1}, x_{2}, x_{3}..., but nowadays one nearly always just uses some set of numbers (while this seems less profound, it obviously saves space). In their original application to representations of the symmetric group, Young tableaux have n distinct entries, arbitrarily assigned to boxes of the diagram, and within that set of tableaux those whose rows and columns are increasing are called standard. In other applications, it is more natural to view the standard Young tableaux as a subset of another set of tableaux, in which larger set the same number is allowed to appear more than once (or not at all). A tableau is then called semistandard, or column strict, if the entries weakly increase along the rows and strictly increase down the columns. Recording the number of times each integer appears in a semistandard tableau gives a sequence known as the weight of the tableau. Now 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 a domino tableaux or ribbon tableaux, in which several boxes may be grouped together before assigning entries to them.

A skew diagram is obtained by removing a smaller Young diagram from a larger one that contains it. If the smaller diagram is $mu=(mu\_1,\; mu\_2,\; ldots)$ and the larger diagram is $lambda=(lambda\_1,\; lambda\_2,\; ldots)$ then we must have $mu\_ileqlambda\_i$ for all $i$. There is however in general more than one way to obtain a given skew diagram in this way, for instance the skew diagram consisting of a single square at position (2,4) can be obtained by removing the diagram of $mu=(5,3,2,1)$ from the one of $lambda=(5,4,2,1)$, but also in (infinitely) many other ways. Skew diagrams can be filled to form skew tableaux, and one can distinguish semistandard and standard skew tableaux in the same way as for Young tableaux. However, when using a skew diagram in such a way to build a tableau, one usually has in mind a specific way to view the diagram as the difference between two Young diagrams, and many operations defined on skew tableaux in fact depend on a choice to so realize the skew diagram. It is then best to define the shape of a skew tableau not as the skew diagram being filled, but as a skew shape consisting explicitly of a pair of partitions $(mu,lambda)$ satisfying $mu\_ileqlambda\_i$ for all $i$, and denoted $lambda/mu$. Young tableaux can be identified with skew tableaux in which $mu$ is the empty partition (0) (the unique partition of 0).

Any skew semistandard tableau T with positive integer entries gives rise to a sequence of partitions (or Young diagrams), by starting with $mu$, and taking for the partition i places further in the sequence the one whose diagram is obtained from that of $mu$ by adding all the boxes that contain a value ≤ i in T. 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).

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–Shensted–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).

In representation theory, standard Young tableaux of size k describe bases in irreducible representations of the symmetric group on k letters. The standard monomial basis in a finite-dimensional irreducible representation of the general linear group GL_{n} are parametrized by the set of semistandard Young tableaux of a fixed shape over the alphabet {1, 2, ..., n}. This has important consequences for invariant theory, starting from the work of Hodge on the homogeneous coordinate ring of the Grassmanian and further explored by Gian-Carlo Rota with collaborators, de Concini and Procesi, and Eisenbud. The Littlewood–Richardson rule describing (among other things) the decomposition of tensor products of irreducible representations of GL_{n} into irreducible components is formulated in terms of certain skew semistandard tableaux.

Applications to algebraic geometry center around Schubert calculus on Grassmanians 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 GL_{n} (when they have at most n nonempty rows), or the irreducible representations of the special linear group SL_{n} (when they have at most n − 1 nonempty rows), or the irreducible complex representations of the special unitary group SU_{n} (again when they have at most n − 1 nonempty rows). In these case 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.

Hook lengths

The dimension of the irreducible representation $pi\_lambda,!$ of the symmetric group S_{n} corresponding to a partition $lambda,!$ 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 hook-length formula.

A hook length hook(x) of a box x in Young diagram $Y(lambda),!$ of shape $lambda,!$ 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:

- $\{rm\; dim\}\; ,\; pi\_lambda\; =\; frac\{n!\}\{prod\_\{x\; in\; Y(lambda)\}\; \{rm\; hook\}(x)\}.$

The figure on the right shows hook-lengths for all boxes in the diagram of the partition 10 = 5 + 4 + 1. Thus $\{rm\; dim\}\; ,\; pi\_lambda\; =\; frac\{10!\}\{1cdot1cdot\; 1\; cdot\; 2cdot\; 3cdot\; 3cdot\; 4cdot\; 5cdot\; 5cdot7\}\; =\; 288.$

A representation of the symmetric group on n elements, S_{n} is also a representation of the symmetric group on n − 1 elements, S_{n−1}. However, an irreducible representation of S_{n} may not be irreducible for S_{n−1}. Instead, it may be a direct sum of several representations that are irreducible for S_{n−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 S_{n}, corresponding to a partition $lambda$ of n, is answered as follows. One forms the set of all Young diagrams that can be obtained from the diagram of shape $lambda$ by removing just one box (which must be at the end both of its row and of its comlumn); the restricted representation then decomposes as a direct sum of the irreducible representations of S_{n−1} corresponding to those diagrams, each occurring exactly once in the sum.

- Partition (number theory)
- Robinson-Schensted algorithm
- jeu de taquin
- Schur–Weyl duality
- Young's lattice

- Macdonald, I. G. Symmetric functions and Hall polynomials. Oxford Mathematical Monographs. The Clarendon Press, Oxford University Press, Oxford, 1979. viii+180 pp. ISBN 0-19-853530-9
- William Fulton. Young Tableaux, with Applications to Representation Theory and Geometry. Cambridge University Press, 1997, ISBN 0521567246.
- Lecture 4 of
- Bruce E. Sagan. The Symmetric Group. Springer, 2001, ISBN 0387950672
- Eric W. Weisstein. " Ferrers Diagram". From MathWorld—A Wolfram Web Resource.
- Eric W. Weisstein. " Young Tableau" From MathWorld—A Wolfram Web Resource.
- Jean-Christophe Novelli, Igor Pak, Alexander V. Stoyanovkii, " A direct bijective proof of the Hook-length formula", Discrete Mathematics and Theoretical Computer Science 1 (1997), pp.53–67.
- Howard Georgi, Lie Algebras in Particle Physics, 2nd Edition - Westview

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Tuesday July 15, 2008 at 20:57:07 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Tuesday July 15, 2008 at 20:57:07 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2015 Dictionary.com, LLC. All rights reserved.