SearcharxivSearch

arXiv · 1910.03623

Invariable generation of finite classical groups

Abstract

A subset of a group invariably generates the group if it generates even when we replace the elements by any of their conjugates. In a 2016 paper, Pemantle, Peres and Rivin show that the probability that four randomly selected elements invariably generate $S_n$ is bounded away from zero by an absolute constant for all $n$. Subsequently, Eberhard, Ford and Green have shown that the probability that three randomly selected elements invariably generate $S_n$ tends to zero as $n \rightarrow \infty$. In this paper, we prove an analogous result for the finite classical groups. More precisely, let $G_r(q)$ be a finite classical group of rank $r$ over $\mathbb{F}_q$. We show that for $q$ large enough, the probability that four randomly selected elements invariably generate $G_r(q)$ is bounded away from zero by an absolute constant for all $r$, and for three elements the probability tends to zero as $q \rightarrow \infty$ and $r \rightarrow \infty$. We use the fact that most elements in $G_r(q)$ are separable and the well-known correspondence between classes of maximal tori containing separable elements in classical groups and conjugacy classes in their Weyl groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Eilidh McKemmie. 2019-10-08. Invariable generation of finite classical groups. https://doi.org/10.1016/j.jalgebra.2021.06.020

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