Computing a set of generators of minimal cardinality in a solvable group
type: Item
instance of: scholarly article
title: Computing a set of generators of minimal cardinality in a solvable group
zbMATH Open document ID: 0830.20003
author: F. Menegazzo
author: Andrea Lucchini
published in: Journal of Symbolic Computation
publication date: 1994-10-13T00:00:00Z
review text: Using ideas of \textit{W. Gaschütz} [Ill. J. Math. 3, 469-476 (1959; Zbl 0093.25002)] two algorithms are presented, which compute a set of generators of minimal cardinality for finite soluble groups. The groups in question are given by a polycyclic presentation. The first algorithm is designed to be used when a chief series is available in advance. The second algorithm is more involved, but it can be used with efficiency in the absence of a chief series, or when such a chief series is expensive to compute.
Mathematics Subject Classification ID: 20-04
Mathematics Subject Classification ID: 20D10
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 20F05
zbMATH DE Number: 638312
zbMATH Keywords: algorithms
zbMATH Keywords: generators
zbMATH Keywords: finite soluble groups
zbMATH Keywords: polycyclic presentation
zbMATH Keywords: chief series
reviewed by: Marian Deaconescu
MaRDI profile type: MaRDI publication profile
full work available at URL: jsco.1994.1027
OpenAlex ID: W2030264049
DOI: 10.1006/JSCO.1994.1027
Recommended article: Q4133821
Recommended article: Special polycyclic generating sequences for finite soluble groups.
Recommended article: Q3338422
Recommended article: Computing the order of a solvable permutation group
Recommended article: Algorithms for finite soluble groups and applications
description: scientific article; zbMATH DE number 638312