On fixed points of elements in primitive permutation groups. (Q468717)

Let \(G\) be a permutation group on a finite set \(\Omega\) of size \(n\). The fixity \(f(G)\) of \(G\) is the maximum of the number of points fixed by any nontrivial element of \(G\); the classical minimal degree is \(n-f(G)\). \textit{J. Saxl} and \textit{A. Shalev} [J. Algebra 174, No. 3, 1122-1140 (1995; Zbl 0832.20002)] investigated primitive permutation groups of prescribed fixity \(f\) and varying \(n\).NEWLINENEWLINE In the present paper the authors examine the situation where \(G\) is a primitive group for which the fixity \(f(G)\) is bounded below by a prescribed function of \(n\). Their main theorem is as follows: a primitive permutation group \(G\) of degree \(n\) either has \(f(G)\geq n^{1/6}\) or belongs to one of five different explicitly defined types. The authors point out that in the exceptional cases \(f(G)\) may be much smaller than \(n^{1/6}\). They also give examples to show that the exponent \(1/6\) cannot be replaced by \(1/5\) in the theorem. As a corollary of this theorem we have: there exists a constant \(c\) such that for any primitive group \(G\) of degree \(n\) either \(f(G)>(\frac{c\log n}{\log\log n})^2\) or \((\mathrm{Soc}(G),n)=(L_2(q),q+1)\) or \((Sz(q),q^2+1)\) in their \(2\)-transitive actions.NEWLINENEWLINE The proof of the theorem is based on several results of independent interest including the following. (Theorem 3): If \(G\) is a primitive permutation group of degree \(n\) such that \(f(G)<n^{1/3}\) then \(G\) is either affine or almost simple. (Corollary 5): If \(G\) is a primitive permutation group of degree \(n\) which is almost simple then either there is an involution which fixes at least \(n^{1/6}\) points, or every involution fixes at most \(2\) points.