Extremely strong Shoda pairs with GAP. (September 2016)

• Record Type: Journal Article
• Authors: Bakshi, Gurmeet K.; Maheshwary, Sugandha
• Is Part Of: Journal of symbolic computation. Volume 76(2016)
• Page Start: 97
• Page End: 106
• Publication Date: 2016-09
• Subjects: primary 20C05 16S34 -- secondary 68W30; Rational group algebra -- Primitive central idempotents -- Strong Shoda pairs -- Extremely strong Shoda pairs -- Normally monomial groups; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2015.12.002
• Languages: English
• ISSNs: 0747-7171

Abstract

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.