Characterization of B(∞) using marginally large tableaux and rigged configurations in the An case via integer sequences
Abstract
Rigged configurations are combinatorial objects prominent in the study of solvable lattice models. Marginally large tableaux are semi-standard Young tableaux of special form that give a realization of the crystals B(∞). We introduce cascading sequences to characterize marginally large tableaux. Then we use cascading sequences and a non-explicit crystal isomorphism between marginally large tableaux and rigged configurations to give a characterization of the latter set, and to give an explicit bijection between the two sets.
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.