2000 character limit reached
Lower Bounds for the Least Prime in Chebotarev (1810.09566v4)
Published 22 Oct 2018 in math.NT
Abstract: In this paper we show there exists an infinite family of number fields $L$, Galois over $\mathbb{Q}$, for which the smallest prime $p$ of $\mathbb{Q}$ which splits completely in $L$ has size at least $( \log(|D_L|) ){2+o(1)}$. This gives a converse to various upper bounds, which shows that they are best possible.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.