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

Simple item page
dc.creatorLecouvey, Cedric
dc.date2002-11-28
dc.date.accessioned2026-07-07T04:53:22Z
dc.date.available2026-07-07T04:53:22Z
dc.descriptionWe 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.
dc.description21 pages
dc.identifierhttps://arxiv.org/abs/math/0211442
dc.identifierhttp://arxiv.org/abs/math/0211442
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65822
dc.subjectQuantum Algebra
dc.subjectCombinatorics
dc.titleAn algorithm for computing the global basis of a finite dimensional irreducible $U_{q}(so_{2n+1})$ or $U_{q}(so_{2n})$-module
dc.typetext

Files

Collections

arXiv