Professional Documents
Culture Documents
Wiki Source
Wiki Source
ion]] between generalized permutations (as 2 lined arrays) and pairs of [[Young_
tableau#Tableaux|semi-standard Young Tableaux]]. [[Richard_P._Stanley|Richard St
anley]] uses this term for these tableaux and abbreviates it as SSYT <ref name=S
tanley> Stanley, Richard P., Enumerative Combinatorics, Volume2. Cambridge Unive
rsity Press. ISBN 0-521-55309-1, 0-521-56069-1. Page 316-380</ref>. Donald Knuth
uses the term generalized Young Tableaux <ref name=Knuth> Knuth, Donald E., Per
mutations, matrices, and generalized Young tableaux. Pacific J. Math. Volume 34,
Number 3 (1970), 709-727. Available at http://projecteuclid.org/DPubS?verb=Disp
lay&version=1.0&service=UI&handle=euclid.pjm/1102971948&page=record</ref>.
== Introduction ==
The [[Robinson-Schensted algorithm]] helps establish a [[bijective]] mapping bet
ween [[permutations]] and pairs of [[Young_tableau|Young Tableaux]], both having
shape <math>\lambda</math>:
<math>\pi \longleftrightarrow (\lambda,P,Q) </math>
where <math>\pi \in S_n </math> is a permutation of order <math>n</math> and <ma
th>P,Q</math> are Young Tableau of shape <math>\lambda</math>.
===Generalized permutations===
A ''generalized permutation'' or two-line array <math>w</math> is defines by<ref
name=Stanley/>:
<math> p = \begin{pmatrix}i_1 & i_2 & \ldots & i_m\\j_1 & j_2 & \ldots & j_m\end
{pmatrix}</math>
where,
# <math>i_1 \leq i_2 \leq i_3 \ldots \leq i_m</math>
# if <math>i_r = i_s</math> and <math>r \leq s</math> then <math>j_r \leq j_s</m
ath>
'''Example''':
<math>p = \begin{pmatrix}1 & 1 & 1 & 2 & 2 & 3 & 3\\
1 & 3 & 3 & 2 & 2 & 1 & 2\end{pmatrix}</math>