The Robinson-Schensted and Schützenberger algorithms, an elementary approach (Q1918890): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 06:14, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Robinson-Schensted and Schützenberger algorithms, an elementary approach |
scientific article |
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
