An algorithm for computing the global basis of a finite dimensional irreducible $U_{q}(so_{2n+1})$ or $U_{q}(so_{2n})$-module

Mathematics – Quantum Algebra

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

21 pages

Scientific paper

We describe a simple algorithm for computing the canonical basis of any
irreducible finite-dimensional $U_{q}(so_{2n+1})$ or $U_{q}(so_{2n})$-module.

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

An algorithm for computing the global basis of a finite dimensional irreducible $U_{q}(so_{2n+1})$ or $U_{q}(so_{2n})$-module 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 An algorithm for computing the global basis of a finite dimensional irreducible $U_{q}(so_{2n+1})$ or $U_{q}(so_{2n})$-module, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An algorithm for computing the global basis of a finite dimensional irreducible $U_{q}(so_{2n+1})$ or $U_{q}(so_{2n})$-module will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-420058

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