Kazhdan-Lusztig polynomials for
arXiv:2102.01278
Abstract
Kazhdan and Lusztig define, for an arbitrary Coxeter system , a family of polynomials indexed by pairs of elements of . 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 .
Comments welcome