arXiv · 2005.02393
Primes in arithmetic progressions and semidefinite programming
Abstract
Assuming the generalized Riemann hypothesis, we give asymptotic bounds on the size of intervals that contain primes from a given arithmetic progression using the approach developed by Carneiro, Milinovich and Soundararajan [Comment. Math. Helv. 94, no. 3 (2019)]. For this we extend the Guinand-Weil explicit formula over all Dirichlet characters modulo $q \geq 3$, and we reduce the associated extremal problems to convex optimization problems that can be solved numerically via semidefinite programming.
Explore related subjects
Keep this discovery
Andrés Chirre, Valdir José Pereira Júnior, David de Laat. 2020-05-05. Primes in arithmetic progressions and semidefinite programming. https://arxiv.org/abs/2005.02393
Cite the original work for its findings. Save a collection to share your selection of sources.