Rigged configurations for all symmetrizable types

17 Feb 2017  ·  Salisbury Ben, Scrimshaw Travis ·

In an earlier work, the authors developed a rigged configuration model for the crystal $B(\infty)$ (which also descends to a model for irreducible highest weight crystals via a cutting procedure). However, the result obtained was only valid in finite types, affine types, and simply-laced indefinite types... In this paper, we show that the rigged configuration model proposed does indeed hold for all symmetrizable types. As an application, we give an easy combinatorial condition that gives a Littlewood-Richardson rule using rigged configurations which is valid in all symmetrizable Kac-Moody types. read more

PDF Abstract
No code implementations yet. Submit your code now

Categories


Combinatorics Representation Theory