2000 character limit reached
RSK correspondence and classically irreducible Kirillov-Reshetikhin crystals
Published 12 Oct 2011 in math.QA and math.CO | (1110.2629v2)
Abstract: We give a new combinatorial model of the Kirillov-Reshetikhin crystals of type $A_n{(1)}$ in terms of non-negative integral matrices based on the classical RSK algorithm, which has a simple description of the affine crystal structure without using a promotion operator. We also have a similar description of the Kirillov-Reshetikhin crystals associated to exceptional nodes in the Dynkin diagrams of classical affine or non-exceptional type.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.