Special polycyclic generating sequences for finite soluble groups.

DOI10.1016/j.jsc.2004.05.003zbMath1125.20304OpenAlexW2060832783MaRDI QIDQ2643571

Bettina Eick, John J. Cannon, Charles R. Leedham-Green

Publication date: 24 August 2007

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2004.05.003

zbMATH Keywords

Hall subgroupsmaximal subgroupsfinite soluble groupsefficient algorithmsalgorithmic group theorypolycyclic generating sequences

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) 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)

Related Items (4)

Filters compatible with isomorphism testing ⋮ On complexity of multiplication in finite soluble groups. ⋮ Computing Hall subgroups of finite groups ⋮ Computation of orders and cycle lengths of automorphisms of finite solvable groups

Uses Software

• GAP
• Magma
• MeatAxe
• Smash

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The vanishing of certain homology and cohomology groups
• Peakword condensation and submodule lattices: An application of the Meat- Axe
• The Magma algebra system. I: The user language
• Computing subgroups by exhibition in finite solvable groups
• Computational approaches to the theory of finite soluble groups

This page was built for publication: Special polycyclic generating sequences for finite soluble groups.