Abstract
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] 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] realized by them. Another algorithm to check whether a finite group G is normally monomial or not is also described.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
