PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
[parent] Young tableau (Definition)

Let $ Y$ be a Young diagram. A filling of $ Y$ is a labelling of the boxes in $ Y$ by positive integers. For example, consider the Young diagram with shape $ \lambda = (4,4,2,1)\vdash 11$.


\begin{renewcommand}{\latticebody}{\ifnum\latticeA<4 \ifnum\latticeB=9 \ar@{-}c;... ...{ 0;<1.7pc,0pc>:<0pc,1.7pc>:: \xylattice{0}{9}{0}{9}} \end{xy}\end{renewcommand}

One filling of this Young diagram is


\begin{renewcommand}{\latticebody}{% \ifnum\latticeA=1 \ifnum\latticeB=4 \ar@{-}... ...{ 0;<1.7pc,0pc>:<0pc,1.7pc>:: \xylattice{0}{9}{0}{9}} \end{xy}\end{renewcommand}

A filling is a Young tableau if it includes each label from $ 1$ to $ n$ exactly once. One Young tableau with shape $ \lambda$ is


\begin{renewcommand}{\latticebody}{% \ifnum\latticeA=1 \ifnum\latticeB=4 \ar@{-}... ...{ 0;<1.7pc,0pc>:<0pc,1.7pc>:: \xylattice{0}{9}{0}{9}} \end{xy}\end{renewcommand}

Each Young tableau with shape $ \lambda\vdash n$ corresponds to a set partition of $ [n]=\{1,\dots,n\}$.

A filling is a semi-standard tableau if the labels monotonically increase in each row and strictly increase in each column. One semi-standard tableau with shape $ \lambda$ is


\begin{renewcommand}{\latticebody}{% \ifnum\latticeA=1 \ifnum\latticeB=4 \ar@{-}... ...{ 0;<1.7pc,0pc>:<0pc,1.7pc>:: \xylattice{0}{9}{0}{9}} \end{xy}\end{renewcommand}

Finally, a semi-standard tableau is a standard Young tableau if it includes each label from $ 1$ to $ n$ exactly once. Hence a standard Young tableau is both a semi-standard tableau and a Young tableau. One standard Young tableau with shape $ \lambda$ is


\begin{renewcommand}{\latticebody}{% \ifnum\latticeA=1 \ifnum\latticeB=4 \ar@{-}... ...{ 0;<1.7pc,0pc>:<0pc,1.7pc>:: \xylattice{0}{9}{0}{9}} \end{xy}\end{renewcommand}

There is some variation in this terminology. For example, Fulton uses the terms tableau and Young tableau interchangeably for what we call a semi-standard Young tableau.

Bibliography

1
William Fulton. Young tableaux: with applications to representation theory and geometry. Cambridge University Press, 1997.
2
Bruce E. Sagan. The symmetric group: representations, combinatorial algorithms, and symmetric functions, 2nd ed. Springer, 2001.
3
Richard P. Stanley. Enumerative combinatorics, volume 2. Cambridge University Press, 1999.



Anyone with an account can edit this entry. Please help improve it!

"Young tableau" is owned by mps. [ full author list (2) ]
(view preamble)

View style:

Other names:  Young tableaux

This object's parent.

Attachments:
Young's projection operators (Definition) by rspuzio
Schur polynomial (Definition) by mps
Log in to rate this entry.
(view current ratings)

Cross-references: strictly, monotonically, integers, positive, labelling, Young diagram
There are 3 references to this entry.

This is version 6 of Young tableau, born on 2007-03-06, modified 2008-04-07.
Object id is 9039, canonical name is YoungTableau.
Accessed 1450 times total.

Classification:
AMS MSC05E05 (Combinatorics :: Algebraic combinatorics :: Symmetric functions)
 05A17 (Combinatorics :: Enumerative combinatorics :: Partitions of integers)
 11P99 (Number theory :: Additive number theory; partitions :: Miscellaneous)
 13B25 (Commutative rings and algebras :: Ring extensions and related topics :: Polynomials over commutative rings)
 20C30 (Group theory and generalizations :: Representation theory of groups :: Representations of finite symmetric groups)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)