Computing in Permutation and Matrix Groups I: Normal Closure, Commutator Subgroups, Series

DOI10.2307/2007343zbMath0552.20002OpenAlexW4255168046MaRDI QIDQ3344109

Gregory Butler, John J. Cannon

Publication date: 1982

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

Full work available at URL: https://doi.org/10.2307/2007343

zbMATH Keywords

backtrack algorithms

Mathematics Subject Classification ID

Series and lattices of subgroups (20D30) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04) General theory for finite permutation groups (20B05)

Related Items

Computing in permutation and matrix groups. III: Sylow subgroups, A proof of Holt's algorithm, Fast recognition of doubly transitive groups, A strong generating test and short presentations for permutation groups, Symmetric ILP: Coloring and small integers, An Inductive Schema for Computing Conjugacy Classes in Permutation Groups, Finite groups, Conjugacy classes in finite permutation groups via homomorphic images, Effective computation with group homomorphisms