SearcharxivSearch

arXiv · 2409.01043

On derangements in simple permutation groups

Abstract

Let $G \leqslant {\rm Sym}(\Omega)$ be a finite transitive permutation group and recall that an element in $G$ is a derangement if it has no fixed points on $\Omega$. Let $\Delta(G)$ be the set of derangements in $G$ and define $\delta(G) = |\Delta(G)|/|G|$ and $\Delta(G)^2 = \{ xy \,:\, x,y \in \Delta(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 $\delta(G) \geqslant 0.016$ and $G = \Delta(G)^2$ for all sufficiently large simple transitive groups $G$. In this paper, we extend these results in several directions. For example, we prove that $\delta(G) \geqslant 89/325$ and $G = \Delta(G)^2$ for all finite simple primitive groups with soluble point stabilisers, without any order assumptions, and we show that the given lower bound on $\delta(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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Timothy C. Burness, Marco Fusari. 2024-09-02. On derangements in simple permutation groups. https://arxiv.org/abs/2409.01043

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR