The Robinson-Schensted and Schützenberger Algorithms, an Elementary Approach
The Robinson-Schensted and Schützenberger Algorithms, an Elementary Approach
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.