A path algorithm for affine Kazhdan-Lusztig polynomials
Let \(\lambda, \mu\) be dominant integral weights of a semisimple Lie algebra \(\mathfrak g\) and let \(l\) be a positive integer larger than the dual Coxeter number of \(\mathfrak g\). Using these data and certain parabolic Kazhdan-Lusztig polynomials for affine Weyl groups, one can define polynomials \(n_{\lambda,\mu}\) in \(\mathbb{Z}[v]\). In this paper the authors describe an algorithm for computing the polynomials \(n_{\lambda,\mu}\) using piecewise linear paths, for all Lie types. This algorithm can be viewed as a generalization of the LLT algorithm [\textit{A. Lascoux}, \textit{B. Leclerc} and \textit{J.-Y. Thibon}, Commun. Math. Phys. 181, 205--263 (1996; Zbl 0874.17009)] to arbitrary weight lattices.
- Lattice paths and Kazhdan-Lusztig polynomials
- Path representation of maximal parabolic Kazhdan-Lusztig polynomials.
- Lattice paths, lexicographic correspondence and Kazhdan-Lusztig polynomials.
- The state of the art in the computation of Kazhdan-Lusztig polynomials
- Paths and Kostka-Macdonald polynomials
- The Carlitz lattice path polynomials
- On the Kazhdan-Lusztig polynomials for affine Weyl groups
- On the computation of Kazhdan-Lusztig polynomials and representations of Hecke algebras
- scientific article; zbMATH DE number 870532
- Construction de polynômes de Kazhdan-Lusztig arbitraires
- Generalized negligible morphisms and their tensor ideals
- A Fock space model for decomposition numbers for quantum groups at roots of unity
- The Lascoux, Leclerc and Thibon algorithm and Soergel's tilting algorithm.
- Quotients of representation rings
- MODULAR DECOMPOSITION NUMBERS OF CYCLOTOMIC HECKE AND DIAGRAMMATIC CHEREDNIK ALGEBRAS: A PATH THEORETIC APPROACH
- Chebyshev type lattice path weight polynomials by a constant term method
This page was built for publication: A path algorithm for affine Kazhdan-Lusztig polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5947786)