Special polycyclic generating sequences for finite soluble groups.

DOI10.1016/J.JSC.2004.05.003MaRDI QIDQ2643571zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmic group theoryefficient algorithmsfinite soluble groupsHall subgroupsmaximal subgroupspolycyclic generating sequences

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) 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) Symbolic computation and algebraic computation (68W30)

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.

Cites work

• Computational approaches to the theory of finite soluble groups
• Computing subgroups by exhibition in finite solvable groups
• scientific article; zbMATH DE number 3889792 (Why is no real title available?)
• scientific article; zbMATH DE number 3871623 (Why is no real title available?)
• scientific article; zbMATH DE number 1004933 (Why is no real title available?)
• Peakword condensation and submodule lattices: An application of the Meat- Axe
• The Magma algebra system. I: The user language
• The vanishing of certain homology and cohomology groups

Cited in

(7)

• Computing a set of generators of minimal cardinality in a solvable group
• Computation of orders and cycle lengths of automorphisms of finite solvable groups
• Filters compatible with isomorphism testing
• On complexity of multiplication in finite soluble groups.
• Computing Hall subgroups of finite groups.
• Finite 2-groups with exactly three automorphism orbits
• To the theorem of K. Doerk

Describes a project that uses

Uses Software

• Magma
• MeatAxe
• Smash
• GAP

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)