The Robinson-Schensted and Schützenberger algorithms, an elementary approach
From MaRDI portal
Publication:1918890
zbMath0852.05080MaRDI QIDQ1918890
Publication date: 21 July 1996
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/Volume_3/volume3_2.html#R15
Young tableauxjeu de taquinhyperoctahedral groupsYoung latticeRobinson-Schensted algorithmfundamental identitiesSchützenberger algorithms
Related Items
Cellular structures on Hecke algebras of type \(B\). ⋮ Longest increasing subsequences in sliding windows ⋮ Knuth relations for the hyperoctahedral groups ⋮ Cell structures on the blob algebra ⋮ Tableau algorithms defined naturally for pictures ⋮ Sign under the domino Robinson-Schensted maps ⋮ Permutations whose reverse shares the same recording tableau in the RS correspondence ⋮ Folding rotationally symmetric tableaux via webs ⋮ Enumerating \(r\)c-invariant permutations with no long decreasing subsequences ⋮ A relation for domino Robinson-Schensted algorithms ⋮ Flag varieties and interpretations of Young tableau algorithms ⋮ Symmetrized models of last passage percolation and non-intersecting lattice paths ⋮ A new link between the descent algebra of type B, domino tableaux and Chow's quasisymmetric functions ⋮ Equivalence classes in the Weyl groups of type \(B_n\). ⋮ Module structure of cells in unequal-parameter Hecke algebras ⋮ Some remarks on sign-balanced and maj-balanced posets ⋮ Interpretations of some parameter dependent generalizations of classical matrix ensembles ⋮ Finite posets and Ferrers shapes ⋮ On Kazhdan-Lusztig cells in type \(B\). ⋮ Complementary algorithms for tableaux ⋮ The Schützenberger involution over Dyck paths ⋮ Bijections between oscillating tableaux and (semi)standard tableaux via growth diagrams ⋮ An affine generalization of evacuation ⋮ Skew domino Schensted correspondence and sign-imbalance
