Publication:2357014: Difference between revisions

From MaRDI portal
Publication:2357014
Created automatically from import240129110113
 
(No difference)

Latest revision as of 17:23, 2 February 2024

DOI10.1007/S11856-017-1507-XzbMATH Open1380.20027arXiv2001.06484OpenAlexW2609159203MaRDI QIDQ2357014FDOQ2357014

Gareth M. Tracey, Andrea Lucchini

Publication date: 7 June 2017

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Abstract: A subset g1,ldots,gd of a finite group G invariably generates G if the set g1x1,ldots,gdxd generates G for every choice of xiinG. 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 first author recently showed that for some absolute constant . In this paper we show that, when G is soluble, then is at most 5/3. We also show that this is best possible. Furthermore, we show that, in general, for each epsilon>0 there exists a constant cepsilon such that C(G)le(1+epsilon)sqrt|G|+cepsilon.


Full work available at URL: https://arxiv.org/abs/2001.06484





Cites Work


Cited In (4)






This page was built for publication: An upper bound on the Chebotarev invariant of a finite group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2357014)