SearcharxivSearch

arXiv · 2507.21025

Derangements in finite classical groups and characteristic polynomials of random matrices

Abstract

We first obtain explicit upper bounds for the proportion of elements in a finite classical group G with a given characteristic polynomial. We use this to complete the proof that the proportion of elements of a finite classical group G which lie in a proper irreducible subgroup tends to 0 as the dimension of the natural module goes to infinity. This result is analogous to the result of Luczak and Pyber [15] that the proportion of elements of the symmetric group S_n which are contained in a proper transitive subgroup other than the alternating group goes to 0 as n goes to infinity. We also show that the probability that 3 random elements of SL(n,q) invariably generate goes to 0 as n goes to infinity.

Explore related subjects

Keep this discovery

BibTeXRIS

Jason Fulman, Robert Guralnick. 2025-07-28. Derangements in finite classical groups and characteristic polynomials of random matrices. https://arxiv.org/abs/2507.21025

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