The Robinson-Schensted and Schützenberger algorithms, an elementary approach

zbMATH Open0852.05080MaRDI QIDQ1918890FDOQ1918890

Authors: Marc van Leeuwen 

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 17892
• Generalized Robinson-Schensted correspondence: A new algorithm
• Schensted algorithms for dual graded graphs

zbMATH Keywords

jeu de taquinYoung tableauxhyperoctahedral groupsYoung latticeRobinson-Schensted algorithmfundamental identitiesSchützenberger algorithms

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10)

Cited In (34)

• A relation for domino Robinson-Schensted algorithms
• Finite posets and Ferrers shapes
• An affine generalization of evacuation
• The Characters of the Infinite Symmetric Group and Probability Properties of the Robinson–Schensted–Knuth Algorithm
• A new link between the descent algebra of type B, domino tableaux and Chow's quasisymmetric functions
• Tableau algorithms defined naturally for pictures
• A \(q\)-weighted version of the Robinson-Schensted algorithm
• A Robinson-Schensted algorithm for a class of partial orders
• Complementary algorithms for tableaux
• Knuth relations for the hyperoctahedral groups
• Permutations whose reverse shares the same recording tableau in the RS correspondence
• Skew domino Schensted correspondence and sign-imbalance
• Equivalence classes in the Weyl groups of type \(B_n\).
• The number of steps in the Robinson-Schensted algorithm
• Title not available (Why is that?)
• Cell structures on the blob algebra.
• The Schützenberger involution over Dyck paths
• Robinson-Schensted algorithm and Vogan equivalence
• Flag varieties and interpretations of Young tableau algorithms
• Folding rotationally symmetric tableaux via webs
• Interpretations of some parameter dependent generalizations of classical matrix ensembles
• Sign under the domino Robinson-Schensted maps
• Generalized Robinson-Schensted correspondence: A new algorithm
• Longest increasing subsequences in sliding windows
• Bijections between oscillating tableaux and (semi)standard tableaux via growth diagrams
• A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm
• Module structure of cells in unequal-parameter Hecke algebras.
• On Kazhdan-Lusztig cells in type \(B\).
• Some remarks on sign-balanced and maj-balanced posets
• On a lemma of Schensted
• Symmetrized models of last passage percolation and non-intersecting lattice paths
• Title not available (Why is that?)
• Cellular structures on Hecke algebras of type \(B\).
• Enumerating \(r\)c-invariant permutations with no long decreasing subsequences

This page was built for publication: The Robinson-Schensted and Schützenberger algorithms, an elementary approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1918890)