Extremely strong Shoda pairs with \texttt{GAP}.
From MaRDI portal
Publication:5963396
Abstract: We provide algorithms to compute a complete irredundant set of extremely strong Shoda pairs of a finite group and the set of the primitive central idempotents of the rational group algebra realized by them. These algorithms are also extended to write new algorithms for computing a complete irredundant set of strong Shoda pairs of and the set of the primitive central idempotents of realized by them. Another algorithm to check whether a finite group is normally monomial or not is also described.
Recommendations
Cites work
- scientific article; zbMATH DE number 3526920 (Why is no real title available?)
- scientific article; zbMATH DE number 3212917 (Why is no real title available?)
- An algorithm to compute the primitive central idempotents and the Wedderburn decomposition of a rational group algebra.
- On Monomial Characters and Central Idempotents of Rational Group Algebras
- Rational group algebras of finite groups: from idempotents to units of integral group rings.
Cited in
(7)- On a generalization of monomial groups
- A generalization of strongly monomial groups
- Semisimple finite group algebra of a generalized strongly monomial group
- Character triples and Shoda pairs
- Finite semisimple group algebra of a normally monomial group
- Structure of group rings and the group of units of integral group rings: an invitation
- A computational approach to Brauer Witt theorem using Shoda pair theory
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)