Lattice paths, lexicographic correspondence and Kazhdan-Lusztig polynomials. (Q2509282): Difference between revisions

The authors give a new closed formula for the Kazhdan-Lusztig polynomials of finite Coxeter groups and affine Weyl groups, which is computationally more efficient than any existing one. The new formula is based on the notion of lexicographic correspondence between Bruhat paths. The authors conjecture that this formula holds for all Coxeter groups.