The Robinson-Schensted and Schützenberger algorithms, an elementary approach
The electronic journal of combinatorics, The Foata Festschrift volume, Tome 3 (1996) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We discuss the Robinson-Schensted and Schützenberger algorithms, and the fundamental identities they satisfy, systematically interpreting Young tableaux as chains in the Young lattice. We also derive a Robinson-Schensted algorithm for the hyperoctahedral groups. Finally we show how the mentioned identities imply some fundamental properties of Schützenberger's glissements.
DOI : 10.37236/1273
Classification : 05E10
Mots-clés : jeu de taquin, Schützenberger algorithms, fundamental identities, Young tableaux, Young lattice, Robinson-Schensted algorithm, hyperoctahedral groups
@article{10_37236_1273,
     author = {Marc van Leeuwen},
     title = {The {Robinson-Schensted} and {Sch\"utzenberger} algorithms, an elementary approach},
     journal = {The electronic journal of combinatorics},
     year = {1996},
     volume = {3},
     number = {2},
     doi = {10.37236/1273},
     zbl = {0852.05080},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1273/}
}
TY  - JOUR
AU  - Marc van Leeuwen
TI  - The Robinson-Schensted and Schützenberger algorithms, an elementary approach
JO  - The electronic journal of combinatorics
PY  - 1996
VL  - 3
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1273/
DO  - 10.37236/1273
ID  - 10_37236_1273
ER  - 
%0 Journal Article
%A Marc van Leeuwen
%T The Robinson-Schensted and Schützenberger algorithms, an elementary approach
%J The electronic journal of combinatorics
%D 1996
%V 3
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/1273/
%R 10.37236/1273
%F 10_37236_1273
Marc van Leeuwen. The Robinson-Schensted and Schützenberger algorithms, an elementary approach. The electronic journal of combinatorics, The Foata Festschrift volume, Tome 3 (1996) no. 2. doi: 10.37236/1273

Cité par Sources :