Kazhdan-Lusztig Algorithm for Whittaker Modules with Arbitrary Infinitesimal Characters
Qixian Zhao

TL;DR
This paper extends the Kazhdan-Lusztig algorithm to compute characters of irreducible Whittaker modules for complex semisimple Lie algebras with arbitrary infinitesimal characters, generalizing previous integral cases.
Contribution
It introduces a Kazhdan-Lusztig algorithm applicable to all infinitesimal characters for Whittaker modules, broadening the scope of character computations.
Findings
Provides a character formula for irreducible Whittaker modules with any infinitesimal character.
Generalizes existing algorithms from integral to arbitrary infinitesimal characters.
Recovers the non-integral Kazhdan-Lusztig conjecture for Verma modules.
Abstract
Let be a complex semisimple Lie algebra. We give a description of characters of irreducible Whittaker modules for with any infinitesimal character, along with a Kazhdan-Lusztig algorithm for computing them. This generalizes Milicic-Soergel's and Romanov's results for integral infinitesimal characters. As a special case, we recover the non-integral Kazhdan-Lusztig conjecture for Verma modules.
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 Topics in Algebra · Advanced Algebra and Geometry
