Primes in arithmetic progressions and semidefinite programming
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:U5Q5F47Drecord.jsonopen to challenge →
classification
math.NT
cs.NAmath.CAmath.NA
keywords
arithmeticprimesproblemsprogrammingsemidefiniteapproachassociatedassuming
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.