Papers
Topics
Authors
Recent
Search
2000 character limit reached

Kazhdan-Lusztig polynomials for $\tilde{B}_2$

Published 2 Feb 2021 in math.RT and math.CO | (2102.01278v1)

Abstract: Kazhdan and Lusztig define, for an arbitrary Coxeter system $(W,S)$, a family of polynomials indexed by pairs of elements of $W$. Despite their relevance and elementary definition, the explicit computation of these polynomials is still one of the hardest open problems in algebraic combinatorics. In this paper we explicitly compute Kazhdan-Lusztig polynomials for a Coxeter system of type $\tilde{B}_2$.

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.