Computing a set of generators of minimal cardinality in a solvable group

DOI10.1006/jsco.1994.1027zbMath0830.20003OpenAlexW2030264049MaRDI QIDQ1333156

Federico Menegazzo, Andrea Lucchini

Publication date: 13 October 1994

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

Full work available at URL: https://doi.org/10.1006/jsco.1994.1027

zbMATH Keywords

algorithmsgeneratorsfinite soluble groupschief seriespolycyclic presentation

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

Related Items

Generating Permutation Groups ⋮ The construction of finite solvable groups revisited. ⋮ Computing generating sets of minimal size in finite algebras ⋮ The minimum generating set problem ⋮ Semiregularity and connectivity of the non-𝔉 graph of a finite group ⋮ An algorithm for finding minimal generating sets of finite groups ⋮ THE GROUPS OF ORDER qⁿ· p