{"paper":{"title":"Finite groups with large Chebotarev invariant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Andrea Lucchini, Gareth Tracey","submitted_at":"2018-11-27T12:27:59Z","abstract_excerpt":"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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10937","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}