A non-recursive criterion for weights of a highest weight module for an affine Lie algebra
O. Barshevsky, M. Fayers, M. Schaps

TL;DR
This paper presents a new non-recursive criterion to determine if a certain weight belongs to a highest weight module of an affine Lie algebra, simplifying previous recursive methods.
Contribution
It introduces a novel non-recursive criterion based on coefficients modulo an integral lattice, enabling efficient computation of weight inclusion.
Findings
The criterion is expressed in terms of coefficients modulo an integral lattice.
The set needed for the criterion can be computed efficiently.
The method simplifies the process of identifying weights in highest weight modules.
Abstract
Let be a dominant integral weight of level for the affine Lie algebra and let be a non-negative integral combination of simple roots. We address the question of whether the weight lies in the set of weights in the irreducible highest-weight module with highest weight . We give a non-recursive criterion in terms of the coefficients of modulo an integral lattice , where is the lattice parameterizing the abelian normal subgroup of the Weyl group. The criterion requires the preliminary computation of a set no larger than the fundamental region for , and we show how this set can be efficiently calculated.
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.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Algebra and Geometry · Advanced Combinatorial Mathematics
