Lusztig's q-analogue of weight multiplicity and one-dimensional sums for affine root systems

Mathematics – Quantum Algebra

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

28 pages; incorrect section 3.4 replaced

Scientific paper

In this paper we complete the proof of the X=K conjecture, that for every family of nonexceptional affine algebras, the graded multiplicities of tensor products of symmetric power Kirillov-Reshetikhin modules known as one-dimensional sums, have a large rank stable limit X that has a simple expression (called the K-polynomial) as nonnegative integer combination of Kostka-Foulkes polynomials. We consider a subfamily of Lusztig's q-analogues of weight multiplicity which we call stable KL polynomials and denote by KL. We give a type-independent proof that K=KL. This proves that X=KL: the family of stable one-dimensional sums coincides with family of stable KL polynomials. Our result generalizes the theorem of Nakayashiki and Yamada which establishes the above equality in the case of one-dimensional sums of affine type A and the Lusztig q-analogue of type A, where both are Kostka-Foulkes polynomials.

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

Lusztig's q-analogue of weight multiplicity and one-dimensional sums for affine root systems 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 Lusztig's q-analogue of weight multiplicity and one-dimensional sums for affine root systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lusztig's q-analogue of weight multiplicity and one-dimensional sums for affine root systems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-263297

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