The Robinson-Schensted and Schützenberger algorithms, an elementary approach (Q1918890)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Robinson-Schensted and Schützenberger algorithms, an elementary approach |
scientific article; zbMATH DE number 907654
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Robinson-Schensted and Schützenberger algorithms, an elementary approach |
scientific article; zbMATH DE number 907654 |
Statements
The Robinson-Schensted and Schützenberger algorithms, an elementary approach (English)
0 references
21 July 1996
0 references
Summary: 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.
0 references
jeu de taquin
0 references
Schützenberger algorithms
0 references
fundamental identities
0 references
Young tableaux
0 references
Young lattice
0 references
Robinson-Schensted algorithm
0 references
hyperoctahedral groups
0 references
