A Path Algorithm for Affine Kazhdan-Lusztig Polynomials
表示论
2007-05-23 v1 组合数学
量子代数
摘要
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.)
引用
@article{arxiv.math/0011245,
title = {A Path Algorithm for Affine Kazhdan-Lusztig Polynomials},
author = {Frederick M. Goodman and Hans Wenzl},
journal= {arXiv preprint arXiv:math/0011245},
year = {2007}
}
备注
To appear in Mathematische Zeitschrift, 13 pages, latex