Linear recurrence relations in $Q$-systems via lattice points in polyhedra
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 quasipolynomial in and establish its properties. We conjecture that there exists a rational polytope such that its Ehrhart quasipolynomial in is and the lattice points of its -th dilate carry the same crystal structure as the crystal associated with .
Cite
@article{arxiv.1602.02347,
title = {Linear recurrence relations in $Q$-systems via lattice points in polyhedra},
author = {Chul-hee Lee},
journal= {arXiv preprint arXiv:1602.02347},
year = {2017}
}
Comments
26 pages. v2: minor changes, references added. v3: Conjecture 3.6 in v2 superseded by Proposition 3.5 in v3, Section 5 added, references added