Diagrammatics for Kazhdan-Lusztig R-polynomials
Abstract
Let (W,S) be an arbitrary Coxeter system. We introduce a family of polynomials, \ Ru,v(t)\, indexed by pairs (u,v) formed by an element u∈ W and a (non-necessarily reduced) word v in the alphabet S. The polynomial Ru,v(t) is obtained by considering a certain subset of Libedinsky's light leaves associated to the pair (u,v). Given a reduced expression v of an element v∈ W; we show that Ru,v(t) coincides with the Kazhdan-- Lusztig R-polynomial Ru,v(t). Using the diagrammatic approach, we obtain some closed formulas for R- polynomials.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.