On the number of generators of a finite group (Q5903357): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Solvable generation of groups and Sylow subgroups of the lower central series / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some applications of the first cohomology group / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4200361 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On finite soluble groups / rank | |||
Normal rank | |||
Latest revision as of 18:35, 17 June 2024
scientific article; zbMATH DE number 3989629
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of generators of a finite group |
scientific article; zbMATH DE number 3989629 |
Statements
On the number of generators of a finite group (English)
0 references
1988
0 references
In 1968 L. G. Kovács proved that a finite soluble group can be generated by \(d+1\) elements if each of its Sylow subgroups can be generated by d elements. The purpose of this paper is to prove a result of the same kind for arbitrary finite groups: Theorem. Let G be a finite group. If every Sylow subgroup of G can be generated by d elements, then G can be generated by 2d elements. The proof uses the classification of the finite simple groups.
0 references
number of generators
0 references
Sylow subgroups
0 references
finite groups
0 references
