The Robinson-Schensted correspondence as the quantum straightening at q=0

1995/04/07 by Bernard Leclerc, B. Leclerc, Leclerc, B. +3 · 1 citation
Mathematics · #Advanced Combinatorial Mathematics #Advanced Topics in Algebra #Algebraic structures and combinatorial models #math.QA #q-alg

paper · pdf · doi:10.48550/arxiv.q-alg/9504004

LaTeX file with eepic pictures, 23 pages

arxiv created 1995/04/07 · arxiv updated 2009/11/30

Abstract

We show that the quantum straightening algorithm for Young tableaux and Young bitableaux reduces in the crystal limit q ↦ 0 to the Robinson-Schensted algorithm.

Cited by

• A quantum algorithm for the quantum Schur-Weyl transform

Related

• WKB approximation, crystals and combinatorics of Young tableaux
• A quantum algorithm for the quantum Schur-Weyl transform
• Axioms for shifted tableau crystals
• Evacuation of rectangular standard Young tableaux corresponds to reflection of \mathfraksl_n webs
• Shifted tableaux crystals