Diagrammatics for Kazhdan-Lusztig R-polynomials
Combinatorics
2018-10-23 v1 Representation Theory
Abstract
Let be an arbitrary Coxeter system. We introduce a family of polynomials, , indexed by pairs formed by an element and a (non-necessarily reduced) word in the alphabet . The polynomial is obtained by considering a certain subset of Libedinsky's light leaves associated to the pair . Given a reduced expression of an element ; we show that coincides with the Kazhdan-- Lusztig -polynomial . Using the diagrammatic approach, we obtain some closed formulas for - polynomials.
Cite
@article{arxiv.1810.08884,
title = {Diagrammatics for Kazhdan-Lusztig R-polynomials},
author = {David Plaza},
journal= {arXiv preprint arXiv:1810.08884},
year = {2018}
}
Comments
20 pages, best viewed in color