A Path Algorithm for Affine Kazhdan-Lusztig Polynomials

Mathematics – Representation Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-398485

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.