A path algorithm for affine Kazhdan-Lusztig polynomials (Q5947786): Difference between revisions

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.