WKB approximation, crystals and combinatorics of Young tableaux

2021/05/27 by Xiaomeng Xu, Xu, Xiaomeng
Mathematics · Physics and Astronomy · #Advanced Topics in Algebra #Algebraic structures and combinatorial models #Classical Analysis and ODEs (math.CA) #FOS: Mathematics #Nonlinear Waves and Solitons #Quantum Algebra (math.QA) #Representation Theory (math.RT)

paper · pdf · doi:10.48550/arxiv.2105.13149

openalex publication_date 2021/05/27 · openalex created_date 2021/10/25 · openalex updated_date 2026/07/28

Abstract

In this paper, we show how various combinatorial algorithms of Young tableaux naturally arise from the WKB approximation of the connection matrix of quantum confluent hypergeometric equation, including the Robinson-Schensted algorithm, the Littlewood-Richardson rule and the Schützenberger involution.

Citations

• Wonderful models of subspace arrangements
• Regularized limits of Stokes matrices, isomonodromy deformation and crystal basis

Related

• The Robinson-Schensted correspondence as the quantum straightening at q=0
• On Two Related Questions of Wilf Concerning Standard Young Tableaux
• Invariants, Kronecker Products, and Combinatorics of Some Remarkable Diophantine Systems (Extended Version)
• Polynomial time classical versus quantum algorithms for representation theoretic multiplicities
• On the combinatorics of tableaux -- A notebook of open problems