Special polycyclic generating sequences for finite soluble groups.

DOI10.1016/J.JSC.2004.05.003zbMATH Open1125.20304OpenAlexW2060832783MaRDI QIDQ2643571FDOQ2643571

Authors: John J. Cannon, B. Eick, C. 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

Recommendations

• Algorithms for polycyclic-by-finite groups
• Computing a set of generators of minimal cardinality in a solvable group
• The algorithmic theory of polycyclic-by-finite groups
• Practical algorithms for polycyclic matrix groups
• Computing polycyclic presentations for polycyclic rational matrix groups.

zbMATH Keywords

finite soluble groupsmaximal subgroupsHall subgroupsefficient 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) Generators, relations, and presentations of groups (20F05) Series and lattices of subgroups (20D30) Software, source code, etc. for problems pertaining to group theory (20-04)

Cites Work

• The Magma algebra system. I: The user language
• Title not available (Why is that?)
• The vanishing of certain homology and cohomology groups
• Peakword condensation and submodule lattices: An application of the Meat- Axe
• Title not available (Why is that?)
• Computational approaches to the theory of finite soluble groups
• Computing subgroups by exhibition in finite solvable groups
• Title not available (Why is that?)

Cited In (4)

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

Uses Software

• GAP
• Magma
• MeatAxe
• Smash

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643571)