Extremely strong Shoda pairs with GAP

详细信息    查看全文

• 作者：Gurmeet K. Bakshi ^{gkbakshi@pu.ac.in" class="auth_mail" title="E-mail the corresponding author} ; Sugandha Maheshwary¹ ; ^{msugandha.87@gmail.com" class="auth_mail" title="E-mail the corresponding author}
• 关键词：primary ; 20C05 ; 16S34 ; secondary ; 68W30
• 刊名：Journal of Symbolic Computation
• 出版年：2016
• 出版时间：September-October 2016
• 年：2016
• 卷：76
• 期：Complete
• 页码：97-106
• 全文大小：674 K

文摘

We provide algorithms to compute a complete irredundant set of extremely strong Shoda pairs of a finite group G   and the set of primitive central idempotents of the rational group algebra Q[G]$\mathbb{Q}[G]$ realized by them. These algorithms are also extended to write new algorithms for computing a complete irredundant set of strong Shoda pairs of G   and the set of primitive central idempotents of Q[G]$\mathbb{Q}[G]$ realized by them. Another algorithm to check whether a finite group G is normally monomial or not is also described.