A proof of Holt's algorithm

DOI10.1016/S0747-7171(88)80029-4zbMath0709.20006MaRDI QIDQ921108

Gregory Butler

Publication date: 1988

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

central seriessubnormal seriesp-groupHolt's algorithmpower commutator presentationstrong generating set

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Finite nilpotent groups, (p)-groups (20D15) Derived series, central series, and generalizations for groups (20F14)

Related Items

An Inductive Schema for Computing Conjugacy Classes in Permutation Groups, Finite \(p\)-groups

Cites Work

• Group-theoretic algorithms and graph isomorphism
• Computing in Permutation and Matrix Groups I: Normal Closure, Commutator Subgroups, Series
• Computing in Permutation and Matrix Groups II: Backtrack Algorithm
• Computing normalizers in permutation groups
• On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item