SearcharxivSearch

arXiv · 2010.02652

Almost elusive permutation groups

Abstract

Let $G$ be a nontrivial transitive permutation group on a finite set $\Omega$. An element of $G$ is said to be a derangement if it has no fixed points on $\Omega$. From the orbit counting lemma, it follows that $G$ contains a derangement, and in fact $G$ contains a derangement of prime power order by a theorem of Fein, Kantor and Schacher. However, there are groups with no derangements of prime order; these are the so-called elusive groups and they have been widely studied in recent years. Extending this notion, we say that $G$ is almost elusive if it contains a unique conjugacy class of derangements of prime order. In this paper we first prove that every quasiprimitive almost elusive group is either almost simple or $2$-transitive of affine type. We then classify all the almost elusive groups that are almost simple and primitive with socle an alternating group, a sporadic group, or a rank one group of Lie type.

Explore related subjects

Keep this discovery

BibTeXRIS

Timothy C. Burness, Emily V. Hall. 2020-10-06. Almost elusive permutation groups. https://arxiv.org/abs/2010.02652

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