SearcharxivSearch

arXiv · 1811.10937

Finite groups with large Chebotarev invariant

Abstract

A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ is said to invariably generate $G$ if the set $\{g_1^{x_1}, \ldots, g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected value of the random variable $n$ that is minimal subject to the requirement that $n$ randomly chosen elements of $G$ invariably generate $G$. The authors recently showed that for each $\epsilon>0$, there exists a constant $c_{\epsilon}$ such that $C(G)\le (1+\epsilon)\sqrt{|G|}+c_{\epsilon}$. This bound is asymptotically best possible. In this paper we prove a partial converse: namely, for each $\alpha>0$ there exists an absolute constant $\delta_{\alpha}$ such that if $G$ is a finite group and $C(G)>\alpha\sqrt{|G|}$, then $G$ has a section $X/Y$ such that $|X/Y|\geq \delta_{\alpha}\sqrt{|G|}$, and $X/Y\cong \mathbb{F}_q\rtimes H$ for some prime power $q$, with $H\le \mathbb{F}_q^{\times}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrea Lucchini, Gareth Tracey. 2018-11-27. Finite groups with large Chebotarev invariant. https://arxiv.org/abs/1811.10937

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