Primes in arithmetic progressions and semidefinite programming
From MaRDI portal
Publication:4999476
DOI10.1090/mcom/3638zbMath1479.11163arXiv2005.02393OpenAlexW3128829584MaRDI QIDQ4999476
David de Laat, Valdir José Pereira Júnior, Andrés Chirre
Publication date: 7 July 2021
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.02393
Semidefinite programming (90C22) Primes in congruence classes (11N13) Distribution of primes (11N05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- On the argument of \(L\)-functions
- New upper bounds on sphere packings. I
- Pair correlation estimates for the zeros of the zeta function via semidefinite programming
- Bandlimited approximations and estimates for the Riemann zeta-function
- Fourier optimization and prime gaps
- Primes in explicit short intervals on RH
- Julia: A Fresh Approach to Numerical Computing
- The large sieve
- Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
- Pre- and Post-Processing Sum-of-Squares Programs in Practice
- Nemo/Hecke
- On the Riemann hypothesis and the difference between primes
- PRIMES AND PRIME IDEALS IN SHORT INTERVALS
- Explicit short intervals for primes in arithmetic progressions on GRH
This page was built for publication: Primes in arithmetic progressions and semidefinite programming