A crystal to rigged configuration bijection for nonexceptional affine algebras
Abstract
Kerov, Kirillov, and Reshetikhin defined a bijection between highest weight vectors in the crystal graph of a tensor power of the vector representation, and combinatorial objects called rigged configurations, for type A(1)n. We define an analogous bijection for all nonexceptional affine types, thereby proving (in this special case) the fermionic formulas conjectured by Hatayama, Kuniba, Takagi, Tsuboi, Yamada, and the first author.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.