Computational approaches to the theory of finite soluble groups

DOI10.1017/S0004972700027386zbMath0635.20006OpenAlexW2107341679MaRDI QIDQ3774056

Stephen P. Glasby

Publication date: 1988

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972700027386

zbMATH Keywords

polynomial solutionsnilpotent quotient algorithmpower-commutator presentationsalgorithmic solutionscovering avoidance algorithmsnormalizers of Hall subgroups

Mathematics Subject Classification ID

Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Sylow subgroups, Sylow properties, (pi)-groups, (pi)-structure (20D20) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (1)

Special polycyclic generating sequences for finite soluble groups.

This page was built for publication: Computational approaches to the theory of finite soluble groups