An Algorithm for Computing the Global Basis of a Finite Dimensional Irreducible<b><i>U</i></b><sub><b><i>q</i></b></sub>(<b><i>so</i></b><sub><b><i>2</i></b><b><i>n</i></b>+<b><i>1</i></b></sub>) or<b><i>U</i></b><sub><b><i>q</i></b></sub>(<b><i>so</i></b><sub><b><i>2</i></b><b><i>n</i></b></sub>)-Module (Q3155528)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Algorithm for Computing the Global Basis of a Finite Dimensional Irreducible<b><i>U</i></b><sub><b><i>q</i></b></sub>(<b><i>so</i></b><sub><b><i>2</i></b><b><i>n</i></b>+<b><i>1</i></b></sub>) or<b><i>U</i></b><sub><b><i>q</i></b></sub>(<b><i>so</i></b><sub><b><i>2</i></b><b><i>n</i></b></sub>)-Module |
scientific article |
Statements
An Algorithm for Computing the Global Basis of a Finite Dimensional Irreducible<b><i>U</i></b><sub><b><i>q</i></b></sub>(<b><i>so</i></b><sub><b><i>2</i></b><b><i>n</i></b>+<b><i>1</i></b></sub>) or<b><i>U</i></b><sub><b><i>q</i></b></sub>(<b><i>so</i></b><sub><b><i>2</i></b><b><i>n</i></b></sub>)-Module (English)
0 references
17 January 2005
0 references
global bases
0 references
combinatorics
0 references
quantum groups
0 references
representation theory
0 references
0 references
