SearcharxivSearch

arXiv · 2108.10190

Almost elusive classical groups

Abstract

Let $G$ be a transitive permutation group acting on a finite set $\Omega$ with $|\Omega|\geqslant 2$. An element of $G$ is said to be a derangement if it has no fixed points on $\Omega$, and by a theorem of Jordan from 1872, $G$ always contains such an element. In particular by a theorem of Fein, Kantor and Schacher $G$ contains a derangement of prime power order. Nevertheless there exist groups in which there are no derangements of prime order, these groups are called elusive groups. Defining an natural extension of this we say $G$ is almost elusive if it contains a unique conjugacy class of derangements of prime order. In recent work with Burness, we reduced the problem of determining the almost elusive quasiprimitive groups to the almost simple and 2-transitive affine cases. Additionally we classified the primitive almost elusive almost simple groups with socle an alternating group, a sporadic group or a group of Lie type with (twisted) Lie rank equal to 1. In this paper we complete the classification of the primitive almost elusive almost simple classical groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Emily V. Hall. 2021-08-23. Almost elusive classical groups. https://arxiv.org/abs/2108.10190

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