A bound on the number of generators of a finite group (Q1822620): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Some applications of the first cohomology group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Zu einem von B. H. und H. Neumann gestellten Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generation of simple groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of generators of a finite group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On finite soluble groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ENUMERATING FINITE GROUPS / rank | |||
Normal rank |
Latest revision as of 10:27, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A bound on the number of generators of a finite group |
scientific article |
Statements
A bound on the number of generators of a finite group (English)
0 references
1989
0 references
The main result that is proved is: Theorem 1. A finite group can be generated by \(d+1\) elements if each of its Sylow subgroups can be generated by \(d\) elements. This generalizes an analogous result for soluble groups proved by L. Kovács in 1968. The proof uses the classification of finite simple groups. Theorem 1 is applied to prove the following conjecture concerning a problem of enumeration of finite groups proposed by P. Neumann: Theorem 2. Let \(f_ d(n)\) be the number of groups of order \(n\) whose Sylow subgroups can all be generated by fewer than \(d\) elements; if \(v(p)=\max\{a\mid p^ a\) divides \(n\}\) and \(m=\max\{v(p)\mid p\) prime\(\}\) then \(f_ d(n)\leq n^{(d+1)m+2}\).
0 references
finite groups
0 references
Sylow subgroups
0 references
numbers of groups
0 references