A rigged configuration model for B(infty)
classification
🧮 math.CO
math.QAmath.RT
keywords
typesinftyriggedaffinecertaincombinatorialconditionsconfiguration
read the original abstract
We describe a combinatorial realization of the crystals $B(\infty)$ and $B(\lambda)$ using rigged configurations in all symmetrizable Kac-Moody types up to certain conditions. This includes all simply-laced types and all non-simply-laced finite and affine types.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.