Papers
Topics
Authors
Recent
Search
2000 character limit reached

Kazhdan-Lusztig Algorithm for Whittaker Modules with Arbitrary Infinitesimal Characters

Published 14 Dec 2021 in math.RT | (2112.07132v4)

Abstract: Let $\mathfrak{g}$ be a complex semisimple Lie algebra. We give a description of characters of irreducible Whittaker modules for $\mathfrak{g}$ 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.