The Robinson-Schensted and Schützenberger algorithms, an elementary approach
type: Item
instance of: scholarly article
title: The Robinson-Schensted and Schützenberger algorithms, an elementary approach
zbMATH Open document ID: 0852.05080
author: Marc van Leeuwen
published in: The Electronic Journal of Combinatorics
publication date: 1996-07-21T00:00:00Z
full work available at URL: R15
review text: 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.
Mathematics Subject Classification ID: 05E10
zbMATH DE Number: 907654
zbMATH Keywords: jeu de taquin
zbMATH Keywords: Schützenberger algorithms
zbMATH Keywords: fundamental identities
zbMATH Keywords: Young tableaux
zbMATH Keywords: Young lattice
zbMATH Keywords: Robinson-Schensted algorithm
zbMATH Keywords: hyperoctahedral groups
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 907654