Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userKazhdan-Lusztig tensoring and Harish-Chandra categories
68
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We use the Kazhdan-Lusztig tensoring to define affine translation functors, describe annihilating ideals of highest weight modules over an affine Lie algebra in terms of the corresponding VOA, and to sketch a functorial approach to ``affine Harish-Chandra bimodules.
rate research
Read More
Expanding the classic works of Kazhdan-Lusztig and Deodhar, we establish bar involutions and canonical (i.e., quasi-parabolic KL) bases on quasi-permutation modules over the type B Hecke algebra, where the bases are parameterized by cosets of (possibly non-parabolic) reflection subgroups of the Weyl group of type B. We formulate an $imath$Schur duality between an $imath$quantum group of type AIII (allowing black nodes in its Satake diagram) and a Hecke algebra of type B acting on a tensor space, providing a common generalization of Jimbo-Schur duality and Bao-Wangs quasi-split $imath$Schur duality. The quasi-parabolic KL bases on quasi-permutation Hecke modules are shown to match with the $imath$canonical basis on the tensor space. An inversion formula for quasi-parabolic KL polynomials is established via the $imath$Schur duality.
We formulate a general super duality conjecture on connections between parabolic categories O of modules over Lie superalgebras and Lie algebras of type A, based on a Fock space formalism of their Kazhdan-Lusztig theories which was initiated by Brundan. We show that the Brundan-Kazhdan-Lusztig (BKL) polynomials for Lie superalgebra gl(m|n) in our parabolic setup can be identified with the usual parabolic Kazhdan-Lusztig polynomials. We establish some special cases of the BKL conjecture on the parabolic category O of gl(m|n)-modules and additional results which support the BKL conjecture and super duality conjecture.
We introduce the notion of minimal reduction type of an affine Springer fiber, and use it to define a map from the set of conjugacy classes in the Weyl group to the set of nilpotent orbits. We show that this map is the same as the one defined by Lusztig, and that the Kazhdan-Lusztig map is a section of our map. This settles several conjectures in the literature. For classical groups, we prove more refined results by introducing and studying the ``skeleta of affine Springer fibers.
The equivariant Kazhdan-Lusztig polynomial of a matroid was introduced by Gedeon, Proudfoot, and Young. Gedeon conjectured an explicit formula for the equivariant Kazhdan-Lusztig polynomials of thagomizer matroids with an action of symmetric groups. In this paper, we discover a new formula for these polynomials which is related to the equivariant Kazhdan-Lusztig polynomials of uniform matroids. Based on our new formula, we confirm Gedeons conjecture by the Pieri rule.
The Kazhdan-Lusztig polynomial of a matroid was introduced by Elias, Proudfoot, and Wakefield [{it Adv. Math. 2016}]. Let $U_{m,d}$ denote the uniform matroid of rank $d$ on a set of $m+d$ elements. Gedeon, Proudfoot, and Young [{it J. Combin. Theory Ser. A, 2017}] pointed out that they can derive an explicit formula of the Kazhdan-Lusztig polynomials of $U_{m,d}$ using equivariant Kazhdan-Lusztig polynomials. In this paper we give two alternative explicit formulas, which allow us to prove the real-rootedness of the Kazhdan-Lusztig polynomials of $U_{m,d}$ for $2leq mleq 15$ and all $d$s. The case $m=1$ was previously proved by Gedeon, Proudfoot, and Young [{it S{e}m. Lothar. Combin. 2017}]. We further determine the $Z$-polynomials of all $U_{m,d}$s and prove the real-rootedness of the $Z$-polynomials of $U_{m,d}$ for $2leq mleq 15$ and all $d$s. Our formula also enables us to give an alternative proof of Gedeon, Proudfoot, and Youngs formula for the Kazhdan-Lusztig polynomials of $U_{m,d}$s without using the equivariant Kazhdan-Lusztig polynomials.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
