WKB approximation, crystals and combinatorics of Young tableaux
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\"utzenberger involution.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.