On Holt's algorithm
From MaRDI portal
Publication:1260764
DOI10.1006/jsco.1993.1016zbMath0780.20001MaRDI QIDQ1260764
Publication date: 25 August 1993
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1993.1016
algorithm; generators; permutation group; base; Sylow subgroup; Schur multiplier; composition series; \(p\)-group; strong generating set; collection methods; power- commutator presentation
20F05: Generators, relations, and presentations of groups
20D15: Finite nilpotent groups, (p)-groups
20-04: Software, source code, etc. for problems pertaining to group theory
20C25: Projective representations and multipliers
20B05: General theory for finite permutation groups
Related Items
An Inductive Schema for Computing Conjugacy Classes in Permutation Groups, Computing double cosets in soluble groups