Multi-grounded partitions and character formulas
Jehanne Dousse, Isaac Konan

TL;DR
This paper introduces multi-grounded partitions to express characters of affine Lie algebra modules, generalizing previous methods to all ground state paths and computing characters for several affine Lie algebra modules.
Contribution
It develops multi-grounded partitions and applies them to compute characters of a broad class of affine Lie algebra modules, extending prior work.
Findings
Characters of level 1 modules for various affine Lie algebras computed.
Generalization from constant to all ground state paths achieved.
New combinatorial framework for affine Lie algebra representations introduced.
Abstract
We introduce a new generalisation of partitions, multi-grounded partitions, related to ground state paths indexed by dominant weights of Lie algebras. We use these to express characters of irreducible highest weight modules of Kac-Moody algebras of affine type as generating functions for multi-grounded partitions. This generalises the approach of our previous paper, where only irreducible highest weight modules with constant ground state paths were considered, to all ground state paths. As an application, we compute the characters of the level modules of the affine Lie algebras , , , , and .
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 Combinatorial Mathematics · Advanced Mathematical Identities
