Refinements of Harman's sieve yield Bombieri-Vinogradov-type mean value theorems for primes to moduli up to x^{9/17} (bilinear) and x^{17/32} (trilinear), plus new almost-all-q bounds on pi(x;q,a).
Primes in arithmetic progressions to large moduli, and Goldbach beyond the square-root barrier
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
representative citing papers
Any classical sifting problem equipped with a Bombieri-Vinogradov error term can be made fully effective by adjusting the sieve bounds to avoid Siegel-zero complications, preserving the original asymptotic form.
Quantum protocol identifies primes via Fourier components of entanglement evolution on NISQ devices, using rescaling noise mitigation and a new analytical bound.
Under GRH, every large even integer is two primes plus six powers of 2, and unconditionally at least 25% of odd numbers are prime plus a power of 2.
citing papers explorer
-
Primes in arithmetic progressions to large moduli and refinements of Harman's sieve
Refinements of Harman's sieve yield Bombieri-Vinogradov-type mean value theorems for primes to moduli up to x^{9/17} (bilinear) and x^{17/32} (trilinear), plus new almost-all-q bounds on pi(x;q,a).
-
An effective Bombieri-Vinogradov error term for sifting problems
Any classical sifting problem equipped with a Bombieri-Vinogradov error term can be made fully effective by adjusting the sieve bounds to avoid Siegel-zero complications, preserving the original asymptotic form.
-
Prime Number Identification Demonstrated with Quantum Processors Using a New Rescaling-Based Noise Mitigation Technique
Quantum protocol identifies primes via Fourier components of entanglement evolution on NISQ devices, using rescaling noise mitigation and a new analytical bound.
-
An update on the Linnik--Goldbach problem
Under GRH, every large even integer is two primes plus six powers of 2, and unconditionally at least 25% of odd numbers are prime plus a power of 2.