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

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

2002-11-28

arxiv.org/abs/math/0211442v1

Mathematics

Quantum Algebra

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.

Affiliated with

Also associated with

No associations

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

Comments { 0 }

Profile ID: LFWR-SCP-O-420058