Papers
Topics
Authors
Recent
Search
2000 character limit reached

Steinberg quotients, Weyl Characters, and Kazhdan-Lusztig Polynomials

Published 26 Jan 2023 in math.RT | (2301.11465v1)

Abstract: Let $G$ be a reductive group over a field of prime characteristic. An indecomposable tilting module for $G$ whose highest weight lies above the Steinberg weight has a character that is divisible by the Steinberg character. The resulting "Steinberg quotient" carries important information about $G$-modules, and in previous work we studied patterns in the weight multiplicities of these characters. In this paper we broaden our scope to include quantum Steinberg quotients, and show how the multiplicities in these characters relate to algebraic Steinberg quotients, Weyl characters, and evaluations of Kazhdan-Lusztig polynomials. We give an explicit algorithm for computing minimal characters that possess a key attribute of Steinberg quotients. We provide computations which show that these minimal characters are not always equal to quantum Steinberg quotients, but are close in several nontrivial cases.

Summary

Paper to Video (Beta)

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.