Linear recurrence relations in $Q$-systems via lattice points in polyhedra
Chul-hee Lee

TL;DR
This paper proves that the characters of Kirillov-Reshetikhin modules follow linear recurrence relations using lattice point formulas, and explores their combinatorial and geometric properties, especially in exceptional Lie types.
Contribution
It establishes linear recurrence relations for KR module characters via lattice points, reduces complex formulas to linear algebra problems, and introduces a conjecture linking dimensions to Ehrhart quasipolynomials.
Findings
Characters satisfy linear recurrence relations in most types.
Dimension functions are quasipolynomials in the module parameter.
New proof of lattice point formulas in type G_2.
Abstract
We prove that the sequence of the characters of the Kirillov-Reshetikhin (KR) modules associated to a node of the Dynkin diagram of a complex simple Lie algebra satisfies a linear recurrence relation except for some cases in types and . To this end we use the -system and the existing lattice point summation formula for the decomposition of KR modules, known as domino removal rules when is of classical type. As an application, we show how to reduce some unproven lattice point summation formulas in exceptional types to finite problems in linear algebra and also give a new proof of them in type , which is the only completely proven case when KR modules have an irreducible summand with multiplicity greater than 1. We also apply the recurrence to prove that the function is a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
