A theorem on random matrices and some applications (Q1379068)

A conjecture of P. J. Cameron states that the proportion of permutations of \(S_n\) which belong to a transitive subgroup other than \(S_n\) or \(A_n\) tends to 0 as \(n\to\infty\). This conjecture has been proved by \textit{T. Łuczak} and \textit{L. Pyber} [Comb. Probab. Comput. 2, No. 4, 505-512 (1993; Zbl 0817.20002)]. It is suggested there that the analogous phenomenon might hold for matrices. In the paper under review the author gives an affirmative answer in the following form: There exists a series of real numbers \(\{\delta_n\}\) tending to 0 such that, for every prime power \(q\), the probability that a randomly chosen matrix in \(\text{GL}(n,q)\) belongs to an irreducible subgroup not containing \(\text{SL}(n,q)\) is at most \(\delta_n\). The proof shows that one can take \(\delta_n=o(1/\log\log\log n)\). The main tools in the proof are recent results of \textit{E. Schmutz} [Isr. J. Math. 91, No. 1-3, 349-371 (1995; Zbl 0840.15016)] on random matrices, as well as known results of M. Aschbacher und M. W. Liebeck on maximal subgroups of classical groups. Section 4 contains some applications concerning generating pairs for the general (and special) linear group.