A path algorithm for affine Kazhdan-Lusztig polynomials

From MaRDI portal



Abstract: We develop an algorithm for computing affine Kazhdan-Lusztig polynomials, for all Lie types. This generalizes our previously published algorithm for type A, which in turn is a faster version of an algorithm due to Lascouz, Leclerc and Thibon (proposed in the setting of Hecke algebras of type A, at roots of unity.)


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.











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)