Mathematics – Representation Theory
Scientific paper
2000-11-28
Mathematics
Representation Theory
To appear in Mathematische Zeitschrift, 13 pages, latex
Scientific paper
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.)
Goodman Frederick M.
Wenzl Hans
No associations
LandOfFree
A Path Algorithm for Affine Kazhdan-Lusztig Polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Path Algorithm for Affine Kazhdan-Lusztig Polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Path Algorithm for Affine Kazhdan-Lusztig Polynomials will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-398485