The Robinson-Schensted and Schützenberger algorithms, an elementary approach
The electronic journal of combinatorics, The Foata Festschrift volume, Tome 3 (1996) no. 2
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
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/}
}
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 :