Papers
Topics
Authors
Recent
Search
2000 character limit reached

Diagrammatics for Kazhdan-Lusztig R-polynomials

Published 21 Oct 2018 in math.CO and math.RT | (1810.08884v1)

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

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.