Extremely strong Shoda pairs with \texttt{GAP}.

From MaRDI portal
Publication:5963396

DOI10.1016/J.JSC.2015.12.002zbMATH Open1336.20003arXiv1503.05674OpenAlexW2251968815MaRDI QIDQ5963396FDOQ5963396

Gurmeet K. Bakshi, Sugandha Maheshwary

Publication date: 19 February 2016

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Abstract: We provide algorithms to compute a complete irredundant set of extremely strong Shoda pairs of a finite group G and the set of the primitive central idempotents of the rational group algebra mathbbQ[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 the primitive central idempotents of mathbbQ[G] realized by them. Another algorithm to check whether a finite group G is normally monomial or not is also described.


Full work available at URL: https://arxiv.org/abs/1503.05674





Cites Work


Cited In (6)

Uses Software






This page was built for publication: Extremely strong Shoda pairs with \texttt{GAP}.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963396)