2000 character limit reached
A pentagon of identities, graded tensor products and the Kirillov-Reshetikhin conjecture
Published 5 Aug 2010 in math.QA, math.CO, and math.RT | (1008.0980v1)
Abstract: This paper provides a brief review of the relations between the Feigin-Loktev conjecture on the dimension of graded tensor products of $\g[t]$-modules, the Kirillov-Reshetikhin conjecture, the combinatorial ``M=N" conjecture, their proofs for all simple Lie algebras, and a pentagon of identities which results from the proof.
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.