On derangements in simple permutation groups

Let G 6 Sym(Ω) be a finite transitive permutation group and recall that an element in G is a derangement if it has no fixed points on Ω. Let ∆(G) be the set of derangements in G and define δ(G) = |∆(G)|/|G| and ∆(G)² = {xy : x, y ∈ ∆(G)}. In recent years, there has been a focus on studying derangements in simple groups, leading to several remarkable results. For example, by combining a theorem of Fulman and Guralnick with recent work by Larsen, Shalev and Tiep, it follows that δ(G) > 0.016 and G = ∆(G)² for all sufficiently large simple transitive groups G. In this paper, we extend these results in several directions. For example, we prove that δ(G) > 89/325 and G = ∆(G)² for all finite simple primitive groups with soluble point stabilisers, without any order assumptions, and we show that the given lower bound on δ(G) is best possible. We also prove that every finite simple transitive group can be generated by two conjugate derangements, and we present several new results on derangements in arbitrary primitive permutation groups.