Primes In Arithmetic Progressions And Semidefinite Programming
Journal article, Peer reviewed
Accepted version
![Thumbnail](/ntnu-xmlui/bitstream/handle/11250/3018411/2005.02393.pdf.jpg?sequence=5&isAllowed=y)
View/ Open
Date
2021Metadata
Show full item recordCollections
- Institutt for matematiske fag [2474]
- Publikasjoner fra CRIStin - NTNU [38278]
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 , and we reduce the associated extremal problems to convex optimization problems that can be solved numerically via semidefinite programming.