English

Diagrammatics for Kazhdan-Lusztig R-polynomials

Combinatorics 2018-10-23 v1 Representation Theory

Abstract

Let (W,S)(W,S) be an arbitrary Coxeter system. We introduce a family of polynomials, {R~u,v(t)}\{ \tilde{\mathcal{R}}_{u,\underline{v}}(t)\}, indexed by pairs (u,v)(u,\underline{v}) formed by an element uWu\in W and a (non-necessarily reduced) word v\underline{v} in the alphabet SS. The polynomial R~u,v(t)\tilde{\mathcal{R}}_{u,\underline{v}}(t) is obtained by considering a certain subset of Libedinsky's light leaves associated to the pair (u,v)(u,\underline{v}). Given a reduced expression v\underline{v} of an element vWv\in W; we show that R~u,v(t)\tilde{\mathcal{R}}_{u,\underline{v}}(t) coincides with the Kazhdan-- Lusztig R~\tilde{R}-polynomial R~u,v(t)\tilde{R}_{u,v}(t). Using the diagrammatic approach, we obtain some closed formulas for R~\tilde{R}- polynomials.

Keywords

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