Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 80 tok/s
Gemini 2.5 Pro 60 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 87 tok/s Pro
Kimi K2 173 tok/s Pro
GPT OSS 120B 433 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Diagrammatics for Kazhdan-Lusztig R-polynomials (1810.08884v1)

Published 21 Oct 2018 in math.CO and math.RT

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.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube