The generalized Robinson-Schensted algorithm on the affine Weyl group of type \(A_{n-1}\)

DOI10.1016/0021-8693(91)90300-WzbMath0743.20043OpenAlexW2330833010MaRDI QIDQ1176670

Jian-yi Shi

Publication date: 25 June 1992

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-8693(91)90300-w

zbMATH Keywords

Young tableauxaffine Weyl groupleft cells

Mathematics Subject Classification ID

Representation theory for linear algebraic groups (20G05) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Related Items (9)

Skew RSK dynamics: Greene invariants, affine crystals and applications toq-Whittaker polynomials ⋮ Monodromy in Kazhdan-Lusztig cells in affine type A ⋮ Sign insertion and Kazhdan-Lusztig cells of affine symmetric groups ⋮ Matrix-ball construction of affine Robinson-Schensted correspondence ⋮ Unnamed Item ⋮ An affine generalization of evacuation ⋮ An affine generalization of evacuation ⋮ Sign types associated to posets ⋮ On two presentations of the affine Weyl groups of classical types

Cites Work

• Unnamed Item
• Cells in affine Weyl groups. II
• The Kazhdan-Lusztig cells in certain affine Weyl groups
• Representations of Coxeter groups and Hecke algebras
• Longest Increasing and Decreasing Subsequences
• Sign Types Corresponding to an Affine Weyl Group
• The structure of Sperner k-families

This page was built for publication: The generalized Robinson-Schensted algorithm on the affine Weyl group of type \(A_{n-1}\)