vix.ing · top · new · best · stats · spec

A Path Algorithm for Affine Kazhdan-Lusztig Polynomials

2000/11/28 by Frederick M. Goodman, Goodman, Frederick M., Hans Wenzl +1
Mathematics · Physics and Astronomy · #Advanced Topics in Algebra #Algebraic structures and combinatorial models #Combinatorics (math.CO) #FOS: Mathematics #Nonlinear Waves and Solitons #Quantum Algebra (math.QA) #Representation Theory (math.RT) #math.CO #math.QA #math.RT

paper · pdf · doi:10.48550/arxiv.math/0011245

To appear in Mathematische Zeitschrift, 13 pages, latex

arxiv created 2000/11/28 · openalex publication_date 2000/11/28 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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

Related