Lattice paths, lexicographic correspondence and Kazhdan-Lusztig polynomials. (Q2509282)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lattice paths, lexicographic correspondence and Kazhdan-Lusztig polynomials. |
scientific article |
Statements
Lattice paths, lexicographic correspondence and Kazhdan-Lusztig polynomials. (English)
0 references
19 October 2006
0 references
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.
0 references
finite Coxeter groups
0 references
affine Weyl groups
0 references
Bruhat orders
0 references
Kazhdan-Lusztig polynomials
0 references
lattice paths
0 references
lexicographic correspondences
0 references
