An algorithm to compute the primitive central idempotents and the Wedderburn decomposition of a rational group algebra. (Q1394942): Difference between revisions

The authors explain an algorithm that computes the primitive central idempotents of the rational group algebras \(\mathbb{Q} G\) for many finite groups \(G\), including Abelian-by-supersolvable groups. They have implemented this algorithm in a package of programs for System GAP, version 4, and also present an experimental comparison of the speed of this algorithm with the classical methods.