An Algorithm for Computing the Global Basis of a Finite Dimensional Irreducible U q ( so 2 n + 1 ) or U q ( so 2 n )-Module: Communications in Algebra: Vol 32, No 5

Views

CrossRef citations to date

Altmetric

Abstract

We describe a simple algorithm for computing the canonical basis of any irreducible finite-dimensional U _q(s o _2n+1) or U _q(s o _2n)-module.

Key Words:

Acknowledgments

Notes

^#Communicated by J. Alev.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

An Algorithm for Computing the Global Basis of a Finite Dimensional Irreducible U_q(so_2n+1) or U_q(so_2n)-Module

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

An Algorithm for Computing the Global Basis of a Finite Dimensional Irreducible Uq(so2n+1) or Uq(so2n)-Module