Generators and minimal normal subgroups
type: Item
instance of: scholarly article
title: Generators and minimal normal subgroups
zbMATH Open document ID: 0831.20031
DOI: 10.1007/BF01198079
author: Andrea Lucchini
published in: Archiv der Mathematik
publication date: 1996-02-11T00:00:00Z
review text: The author addresses the problem that given a minimal normal subgroup \(N\) in a finite group \(G\neq N\), compare the least number \(d(G)\) of elements required to generate \(G\) with \(d(G/N)\). It is proven here that \(d(G)\leq d(G/N)+1\). Furthermore if \(t\) is the length of a chief series in \(G\), then \(d(G)\leq t+1\). In addition, if \(m\) is the number of nonabelian factors in an arbitrary chief series, then the presentation rank of \(G\) is at most \(m\). A key point in the proof of the main theorem rests on a recently proven result by the author and \textit{F. Dalla Volta} that for a finite nonabelian simple group \(S\), for every pair \(\{x,y\}\) of elements in \(\text{Aut}(S)\), the subgroup \(\langle x,y,\text{Inn}(S)\rangle\) can be generated by two elements [J. Algebra 178, No. 1, 194-223 (1995)].
Mathematics Subject Classification ID: 20D60
Mathematics Subject Classification ID: 20F05
Mathematics Subject Classification ID: 20D30
Mathematics Subject Classification ID: 20D45
zbMATH DE Number: 756428
zbMATH Keywords: minimal number of generators
zbMATH Keywords: minimal normal subgroups
zbMATH Keywords: length
zbMATH Keywords: chief series
zbMATH Keywords: presentation rank
reviewed by: Homer F. Bechtell
MaRDI profile type: Publication
cites work: Some applications of the first cohomology group
cites work: Generation of almost simple groups
cites work: Zu einem von B. H. und H. Neumann gestellten Problem
cites work: Die Eulersche Funktion endlicher auflösbarer Gruppen
cites work: Q4092172
cites work: On the generation gap of a finite group
description: scientific article; zbMATH DE number 756428