The probability of generating a finite simple group (Q1900055): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01263616 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2078590838 / rank | |||
Normal rank |
Latest revision as of 09:26, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The probability of generating a finite simple group |
scientific article |
Statements
The probability of generating a finite simple group (English)
0 references
16 April 1996
0 references
In the paper [Math. Z. 110, 199-205 (1969; Zbl 0176.29901)] the reviewer proved that a pair of randomly chosen elements from the alternating \(A_n\) generates \(A_n\) with probability tending to 1 as \(n\to\infty\). He conjectured that a similar result is true for the other infinite classes of finite simple groups. This conjecture was verified for the classical simple groups and for small rank exceptional groups by \textit{W. M. Kantor} and \textit{A. Lubotzky} [Geom. Dedicata 36, 67-87 (1990; Zbl 0718.20011)]. The authors of the present paper have finally settled the remaining cases to show that the following slightly stronger statement is true. Let \(G_0\) be a finite simple group, and let \(G\) be a group such that \(G_0\leq G\leq\Aut(G_0)\). Then the probability that two randomly chosen elements of \(G\) generate a subgroup containing \(G_0\) tends to 1 as \(|G|\to\infty\). The proof requires, of course, the classification of finite simple groups as well as detailed properties of the groups in question.
0 references
randomly chosen elements
0 references
finite simple groups
0 references
probability
0 references