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 by Cédric Lecouvey, Cedric Lecouvey, Lecouvey, Cedric
Mathematics · #Advanced Topics in Algebra #Algebraic structures and combinatorial models #Commutative Algebra and Its Applications #math.CO #math.QA

paper · pdf · doi:10.48550/arxiv.math/0211442

21 pages

arxiv created 2002/11/28 · arxiv updated 2009/11/30

Abstract

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.

Related

• An algorithm for computing the global basis of an irreducible U_q(sp_2n)-module
• An algorithm to compute the canonical basis of an irreducible Uq(g)-module
• Schensted type correspondence for type G₂ and computation of the canonical basis of a finite dimensional U_q(G₂)-module
• Explicit construction of irreducible modules for U_q(gl_n)
• Finite-dimensional irreducible U_q(\mathfraksl₂)-modules from the equitable point of view