An algorithm to compute the primitive central idempotents and the Wedderburn decomposition of a rational group algebra. (Q1394942): Difference between revisions
From MaRDI portal
Latest revision as of 11:46, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm to compute the primitive central idempotents and the Wedderburn decomposition of a rational group algebra. |
scientific article |
Statements
An algorithm to compute the primitive central idempotents and the Wedderburn decomposition of a rational group algebra. (English)
0 references
25 June 2003
0 references
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.
0 references
group rings
0 references
primitive central idempotents
0 references
algorithms
0 references
programs
0 references
Wedderburn decompositions
0 references
0 references