On Holt's algorithm (Q1260764): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q755889 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Joachim Neubüser / rank | |||
Normal rank |
Revision as of 19:54, 20 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On Holt's algorithm |
scientific article |
Statements
On Holt's algorithm (English)
0 references
25 August 1993
0 references
\textit{D. F. Holt} [Comput. group theory, Proc. Symp., Durham 1982, 307-319 (1984; Zbl 0544.20004)] has described an algorithm for the computation of the Schur multiplier of a permutation group \(G\). As one of the steps, after finding a Sylow subgroup \(P\) of \(G\), he needs a power-commutator presentation of \(P\) in order to use collection methods for the determination of the Schur multiplier of \(P\). In this paper the authors detail the method for finding for a \(p\)-group (given as a permutation group by base and strong generating set) a power-commutator presentation such that the generators contained in a group \(G_ i\) of the underlying composition series form a strong generating set for \(G_ i\).
0 references
algorithm
0 references
Schur multiplier
0 references
permutation group
0 references
Sylow subgroup
0 references
power- commutator presentation
0 references
collection methods
0 references
\(p\)-group
0 references
base
0 references
strong generating set
0 references
generators
0 references
composition series
0 references