Enumerating Non-Soluble Groups-A Conjecture of John G. Thompson (Q3729149)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3961940
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating Non-Soluble Groups-A Conjecture of John G. Thompson |
scientific article; zbMATH DE number 3961940 |
Statements
Enumerating Non-Soluble Groups-A Conjecture of John G. Thompson (English)
0 references
1986
0 references
non-soluble groups
0 references
non-abelian composition factors
0 references
number of isomorphism classes of groups
0 references
number of groups
0 references
0.8244578838348389
0 references
0.8152300715446472
0 references
0.7870595455169678
0 references
0.7870595455169678
0 references
The conjecture of the title is concerned with the perceived rarity of non-soluble groups among finite groups of given bounded order. For \(G\) a finite group, Thompson defined \(\tau (G)=| G|^{-1}\prod | H/K|\) where the product is over all the non-abelian composition factors \(H/K\) of \(G\). \((\tau (G)=0\) if \(G\) is soluble). Given \(\varepsilon\geq 0\), let \(f_{\varepsilon}(n)\) be the number of isomorphism classes of groups \(G\) with \(| G| \leq n\) and \(\tau (G)\geq \varepsilon\). Thompson conjectured that for all \(\varepsilon >0\), \[ \lim_{n\to \infty}f_{\varepsilon}(n)/f_ 0(n)=0. \] The authors establish this conjecture. A key result obtained along the way is: The number of groups of order \(n\geq 2\) with no nontrivial normal soluble subgroup is at most \(\ell (n)^{\ell (n)^ 2}\cdot n^{\ell (n)+2}\) where \(\ell (n)=\log_ 2n\).
0 references