An algorithm for computing the global basis of a finite dimensional irreducible $U_{q}(so_{2n+1})$ or $U_{q}(so_{2n})$-module
Quantum Algebra
2007-05-23 v1 Combinatorics
Abstract
We describe a simple algorithm for computing the canonical basis of any irreducible finite-dimensional or -module.
Keywords
Cite
@article{arxiv.math/0211442,
title = {An algorithm for computing the global basis of a finite dimensional irreducible $U_{q}(so_{2n+1})$ or $U_{q}(so_{2n})$-module},
author = {Cedric Lecouvey},
journal= {arXiv preprint arXiv:math/0211442},
year = {2007}
}
Comments
21 pages