Random generation of finite simple groups (Q1306842)

From MaRDI portal
Revision as of 17:52, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Random generation of finite simple groups
scientific article

    Statements

    Random generation of finite simple groups (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 December 1999
    0 references
    \textit{J. D. Dixon} [Math. Z. 110, 199-205 (1969; Zbl 0176.29901)] conjectured that if two elements are randomly chosen from a finite simple group \(G\), they will generate \(G\) with probability \(\to 1\) as \(|G|\to\infty\). Dixon [ibid.] proved this if \(G\) is an alternating group. \textit{W. M. Kantor} and \textit{A. Lubotzky} [Geom. Dedicata 36, No. 1, 67-87 (1990; Zbl 0718.20011)] proved Dixon's conjecture for classical groups and certain exceptional groups. \textit{M. W. Liebeck} and \textit{A. Shalev} [Geom. Dedicata 56, No. 1, 103-113 (1995; Zbl 0836.20068)] settled the remaining exceptional groups. G. Robinson posed the problem of random generation by two conjugate elements. Kantor and Lubotzky [ibid. Conjecture 2, p.~78] posed the problem of generation by a fixed element and a randomly chosen one. In the paper under review the authors prove the following two theorems. Theorem 1: Let \(G\) be a finite simple group, and let \(x,y\in G\) be randomly chosen elements. Then the probability that \(x\), \(x^y\) generate \(G\) tends to \(1\) as \(|G|\to\infty\). Theorem 2: There exists a function \(f\colon\mathbb{R}\to\mathbb{R}\) with the following property. Let \(G\) be a finite simple group and fix \(\varepsilon>0\). Suppose there exists \(1\neq x\in G\) such that the probability that \(x\) and a randomly chosen element \(y\) generate \(G\) doesn't exceed \(1-\varepsilon\). Then either \(|G|\leq f(\varepsilon)\), or \(G\) is alternating, or \(G\) is a classical group over a field of size at most \(f(\varepsilon)\). \textit{A. Shalev} [Bull. Lond. Math. Soc. 29, No. 5, 571-576 (1997; Zbl 0904.20020)] proved Theorem 1 for alternating groups and for some classical groups. The proofs of Theorems 1 and 2 for classical groups in general are given by \textit{M. W. Liebeck} and \textit{A. Shalev} [J. Am. Math. Soc. 12, No. 2, 497-520 (1999; Zbl 0916.20003)]. The converse of Theorem 2 is proved by \textit{R. M. Guralnick}, \textit{W. M. Kantor} and \textit{J. Saxl} [Commun. Algebra 22, No. 4, 1395-1402 (1994; Zbl 0820.20022)].
    0 references
    random generation by conjugates
    0 references
    classical groups
    0 references
    exceptional groups
    0 references
    finite simple groups
    0 references
    randomly chosen elements
    0 references
    alternating groups
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references