Virtual crystals and Kleber's algorithm

Mathematics – Quantum Algebra

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

23 pages; style file youngtab.sty required, package pstricks required

Scientific paper

10.1007/s00220-003-0855-z

Kirillov and Reshetikhin conjectured what is now known as the fermionic formula for the decomposition of tensor products of certain finite dimensional modules over quantum affine algebras. This formula can also be extended to the case of $q$-deformations of tensor product multiplicities as recently conjectured by Hatayama et al. (math.QA/9812022 and math.QA/0102113). In its original formulation it is difficult to compute the fermionic formula efficiently. Kleber (q-alg/9611032 and math.QA/9809087) found an algorithm for the simply-laced algebras which overcomes this problem. We present a method which reduces all other cases to the simply-laced case using embeddings of affine algebras. This is the fermionic analogue of the virtual crystal construction by the authors, which is the realization of crystal graphs for arbitrary quantum affine algebras in terms of those of simply-laced type.

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

Virtual crystals and Kleber's algorithm 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 Virtual crystals and Kleber's algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Virtual crystals and Kleber's algorithm will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-642141

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