Random generation of finite simple groups by \(p\)-regular or \(p\)-singular elements (Q5951506): Difference between revisions

Let \(G\) run over the finite simple groups. It is known that if \(x\) and \(y\) are randomly chosen elements of \(G\), then the probability that \(x\) and \(y\) generate the whole of \(G\) tends to \(1\) as \(|G|\to\infty\) [see \textit{J. D. Dixon}, Math. Z. 110, 199-205 (1969; Zbl 0176.29901); \textit{W. M. Kantor} and \textit{A. Lubotzky}, Geom. Dedicata 36, No. 1, 67-87 (1990; Zbl 0718.20011); and \textit{M. W. Liebeck} and \textit{A. Shalev}, Geom. Dedicata 56, No. 1, 103-113 (1995; Zbl 0836.20068)]. It is also known that the same conclusion holds even when \(x\) and \(y\) are restricted in various ways. The present paper gives a further theorem along these lines. The author proves that for any fixed prime \(p\) the same conclusion holds in each of the following cases: (i) both \(x\) and \(y\) are randomly chosen \(p\)-regular elements; (ii) if \(p\mid|G|\) (and \(G\neq L_2(q)\) with \(q\) even when \(p=2\)), and both \(x\) and \(y\) are randomly chosen \(p\)-singular elements; or (iii) if \(p\mid|G|\), and \(x\) is a randomly chosen \(p\)-singular element and \(y\) is a randomly chosen \(p\)-regular element. A principal idea behind the proof is the following. For any subset \(S\subseteq G\), let \(Q_S(G)\) denote the probability that two random elements from \(S\) do \textit{not} generate \(G\). Then there is a constant \(c\) such that for each finite simple group \(G\) and each subset \(S\), we have \(Q_S(G)\leq c|G|^2m(G)^{-1}|S|^{-2}\) where \(m(G)\) is the smallest index of a proper subgroup in \(G\).