2000 character limit reached
Explicit counting of ideals and a Brun-Titchmarsh inequality for the Chebotarev Density Theorem (1611.10103v2)
Published 30 Nov 2016 in math.NT
Abstract: We prove a bound on the number of primes with a given splitting behaviour in a given field extension. This bound generalises the Brun-Titchmarsh bound on the number of primes in an arithmetic progression. The proof is set up as an application of Selberg's Sieve in number fields. The main new ingredient is an explicit counting result estimating the number of integral elements with certain properties up to multiplication by units. As a consequence of this result, we deduce an explicit estimate for the number of ideals of norm up to $x$.
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.