SearcharxivSearch

arXiv · 2008.03812

On the probability of generating invariably a finite simple group

Abstract

Let $G$ be a finite simple group. In this paper we consider the existence of small subsets $A$ of $G$ with the property that, if $y \in G$ is chosen uniformly at random, then with high probability $y$ invariably generates $G$ together with some element of $A$. We prove various results in this direction, both positive and negative. As a corollary, we prove that two randomly chosen elements of a finite simple group of Lie type of bounded rank invariably generate with probability bounded away from zero. Our method is based on the positive solution of the Boston--Shalev conjecture by Fulman and Guralnick, as well as on certain connections between the properties of invariable generation of a group of Lie type and the structure of its Weyl group.

Explore related subjects

Keep this discovery

BibTeXRIS

Daniele Garzoni, Eilidh McKemmie. 2020-08-09. On the probability of generating invariably a finite simple group. https://arxiv.org/abs/2008.03812

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