{"title":"The Chebotarev invariant for direct products of nonabelian finite simple groups","authors":"Jessica Anzanello, Andrea Lucchini, Gareth Tracey","doi":"arxiv-2408.12298","DOIUrl":null,"url":null,"abstract":"A subset $\\{g_1, \\ldots , g_d\\}$ of a finite group $G$ invariably generates\n$G$ if $\\{g_1^{x_1}, \\ldots , g_d^{x_d}\\}$ generates $G$ for every choice of\n$x_i \\in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected value of\nthe random variable $n$ that is minimal subject to the requirement that $n$\nrandomly chosen elements of $G$ invariably generate $G$. In this paper, we show\nthat if $G$ is a nonabelian finite simple group, then $C(G)$ is absolutely\nbounded. More generally, we show that if $G$ is a direct product of $k$\nnonabelian finite simple groups, then $C(G)=\\log{k}/\\log{\\alpha(G)}+O(1)$,\nwhere $\\alpha$ is an invariant completely determined by the proportion of\nderangements of the primitive permutation actions of the factors in $G$. It\nfollows from the proof of the Boston-Shalev conjecture that $C(G)=O(\\log{k})$.\nWe also derive sharp bounds on the expected number of generators for $G$.","PeriodicalId":501037,"journal":{"name":"arXiv - MATH - Group Theory","volume":"10 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Group Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.12298","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ invariably generates
$G$ if $\{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$. In this paper, we show
that if $G$ is a nonabelian finite simple group, then $C(G)$ is absolutely
bounded. More generally, we show that if $G$ is a direct product of $k$
nonabelian finite simple groups, then $C(G)=\log{k}/\log{\alpha(G)}+O(1)$,
where $\alpha$ is an invariant completely determined by the proportion of
derangements of the primitive permutation actions of the factors in $G$. It
follows from the proof of the Boston-Shalev conjecture that $C(G)=O(\log{k})$.
We also derive sharp bounds on the expected number of generators for $G$.