A unified and improved Chebotarev density theorem

From MaRDI portal
Publication:2313552




Abstract: We establish an unconditional effective Chebotarev density theorem that improves uniformly over the well-known result of Lagarias and Odlyzko. As a consequence, we give a new asymptotic form of the Chebotarev density theorem that can count much smaller primes with arbitrary log-power savings, even in the case where a Landau-Siegel zero is present. Our main theorem interpolates the strongest unconditional upper bound for the least prime ideal with a given Artin symbol as well as the Chebotarev analogue of the Brun-Titchmarsh theorem proved by the authors. We also present a new application of our main result that exhibits considerable gains over earlier versions of the Chebotarev density theorem. If f is a positive definite primitive binary quadratic form then we count lattice points (u,v)inmathbbZ2 such that f(u,v) is prime and u,v have no prime factors leqz with uniformity in z and the discriminant of f.




Cited in
(26)






This page was built for publication: A unified and improved Chebotarev density theorem

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