2000 character limit reached
Kazhdan-Lusztig polynomials and subexpressions
Published 31 Mar 2020 in math.CO and math.RT | (2004.00045v1)
Abstract: We refine an idea of Deodhar, whose goal is a counting formula for Kazhdan-Lusztig polynomials. This is a consequence of a simple observation that one can use the solution of Soergel's conjecture to make ambiguities involved in defining certain morphisms between Soergel bimodules in characteristic zero (double leaves) disappear.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.