A Path Algorithm for Affine Kazhdan-Lusztig Polynomials

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 r...

Full description

Saved in:
Bibliographic Details
Main Authors Goodman, Frederick M, Wenzl, Hans
Format Journal Article
LanguageEnglish
Published 28.11.2000
Subjects
Mathematics - Combinatorics
Mathematics - Quantum Algebra
Mathematics - Representation Theory
Online AccessGet full text
DOI10.48550/arxiv.math/0011245

Cover

More Information
Summary: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.)
DOI:10.48550/arxiv.math/0011245