Algorithms of q-Schur Algebra
In 1989, Dipper and Jamed 2 extend the notion of a Schur algebra, see Green 8, to obtain the q-Schur algebra Sq(n,r). One of the main difficulties that can not be solved is to determine a suitable mathematical formula for the product between two elements in Sq(n,r), except for the mathmatical fo...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
College of Education for Pure Sciences
2006-06-01
|
| Series: | مجلة التربية والعلم |
| Subjects: | |
| Online Access: | https://edusj.mosuljournals.com/article_77373_2d6ec08c7cca32d6ca15bc0765d7066c.pdf |
| Summary: | In 1989, Dipper and Jamed 2 extend the notion of a Schur algebra, see Green 8, to obtain the q-Schur algebra Sq(n,r). One of the main difficulties that can not be solved is to determine a suitable mathematical formula for the product between two elements in Sq(n,r), except for the mathmatical formua introduced by Green in 8 and the <br /> programming formula that supported this formula which is given 11 when q=1. |
|---|---|
| ISSN: | 1812-125X 2664-2530 |