Generators for finite groups with a unique minimal normal subgroup
From MaRDI portal
The authors prove that, if \(G\) is a finite group having a unique minimal normal subgroup \(N\), then the number of elements needed to generate \(G\) is not more than the number needed to generate \(G/N\) (assuming the latter number is at least two). The proof depends on the classification of finite simple groups, and about half of the paper is occupied with proving a lemma about outer automorphisms of non-abelian finite simple groups by considering various cases.
Recommendations
Cites work
- Die Eulersche Funktion endlicher auflösbarer Gruppen
- Generation of almost simple groups
- Generators and minimal normal subgroups
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 46141 (Why is no real title available?)
- Some applications of the first cohomology group
Cited in
(36)- Generating wreath products and their augmentation ideals
- Maximal complements in wreath products.
- Minimal generation of transitive permutation groups
- Generators and minimal normal subgroups
- Asymptotic results for primitive permutation groups and irreducible linear groups.
- Flexibility in generating sets of finite groups
- On the connectivity of the non-generating graph
- The 2-closure of a \(\frac{3}{2}\)-transitive group in polynomial time
- A reduction theorem for nonsolvable finite groups
- Coprime invariable generation and minimal-exponent groups.
- On the length of a finite group and of its 2-generator subgroups
- Maximal subgroups of finite groups avoiding the elements of a generating set
- Generation and random generation: from simple groups to maximal subgroups.
- Complements of the socle in almost simple groups.
- The spread of a finite group
- The size of a minimal generating set for primitive \(\frac{3}{2} \)-transitive groups
- Generating minimally transitive permutation groups.
- GENERATING MAXIMAL SUBGROUPS OF FINITE ALMOST SIMPLE GROUPS
- scientific article; zbMATH DE number 15594 (Why is no real title available?)
- On boundedly generated subgroups of profinite groups.
- A generalization of the Burnside basis theorem.
- scientific article; zbMATH DE number 1154720 (Why is no real title available?)
- Orbits of primitive k-homogeneous groups on (n-k)-partitions with applications to semigroups
- Generation of second maximal subgroups and the existence of special primes
- On the uniform spread of almost simple linear groups.
- Detecting the prime divisors of the character degrees and the class sizes by a subgroup generated with few elements
- On the number of generators of finite images of free products of finite groups
- FINITE GROUPS WITH INDEPENDENT GENERATING SETS OF ONLY TWO SIZES
- The minimum generating set problem
- Recognizing the prime divisors of the index of a proper subgroup.
- On minimal coverings and pairwise generation of some primitive groups of wreath product type
- On the connectivity of the generating and rank graphs of finite groups
- On finite solvable groups G with m(G) - d(G) = 1
- Finite groups with the minimal generating set exchange property
- Generation of iterated wreath products constructed from alternating, symmetric and cyclic groups
- The probability of generating finite and profinite groups
This page was built for publication: Generators for finite groups with a unique minimal normal subgroup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1378843)
