An upper bound on the Chebotarev invariant of a finite group

preprint2020arXivOpen access

Abstract

A subset {g1,…,gd}\{g_1, \ldots , g_d\} of a finite group GG invariably generates GG if the set {g1x1,…,gdxd}\{g_1^{x_1}, \ldots, g_d^{x_d}\} generates GG for every choice of xi∈Gx_i \in G. The Chebotarev invariant C(G)C(G) of GG is the expected value of the random variable nn that is minimal subject to the requirement that nn randomly chosen elements of GG invariably generate GG. The first author recently showed that C(G)≤β∣G∣C(G)\le β\sqrt{|G|} for some absolute constant ββ. In this paper we show that, when GG is soluble, then ββ is at most 5/35/3. We also show that this is best possible. Furthermore, we show that, in general, for each ε>0ε>0 there exists a constant cεc_ε such that C(G)≤(1+ε)∣G∣+cεC(G)\le (1+ε)\sqrt{|G|}+c_ε.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.