A Path Algorithm for Affine Kazhdan-Lusztig Polynomials

Simple item page
dc.creatorGoodman, Frederick M.
dc.creatorWenzl, Hans
dc.date2000-11-28
dc.date.accessioned2026-07-07T04:38:54Z
dc.date.available2026-07-07T04:38:54Z
dc.descriptionWe 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.)
dc.descriptionTo appear in Mathematische Zeitschrift, 13 pages, latex
dc.identifierhttps://arxiv.org/abs/math/0011245
dc.identifierhttp://arxiv.org/abs/math/0011245
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/60462
dc.subjectRepresentation Theory
dc.subjectCombinatorics
dc.subjectQuantum Algebra
dc.titleA Path Algorithm for Affine Kazhdan-Lusztig Polynomials
dc.typetext

Files

Collections

arXiv