The probability of generating certain profinite groups by two elements (Q1327513): Difference between revisions

Some time ago the reviewer proved that (in a suitable sense) a pair of permutations chosen at random from the symmetric group of degree \(n\) usually generates a subgroup containing the alternating group [see \textit{J. D. Dixon}, Math. Z. 110, 199-299 (1969; Zbl 0176.299)]. This result has been generalized and strengthened in various ways, [see, for example, \textit{M. W. Liebeck} and \textit{A. Shalev}, ``The probability of generating a finite simple group'' (Geom. Dedicata, to appear)]. In the paper under review, the author considers the analogous question for the class of profinite groups which are inverse limits of iterated (permutational) wreath products of the form \(A_{m_ k} \text{Wr }A_{m_{k - 1}} \text{Wr} \dots \text{Wr }A_{m_ 1}\) where the \(A_{m_ i}\) are alternating groups of degree \(m_ i \geq 5\). She shows that the probability of generating such a group by two ``random'' elements is strictly positive and can be made arbitrarily close to 1 by taking \(m_ 1\) sufficiently large. The proof involves an application of the O'Nan-Scott theorem to analyze the primitive permutation groups which arise.