Barban–Davenport–Halberstam conjecture for primes in short intervals and arithmetic progressions

About 15 years old · traced to

Let θ(x;q,a)\theta(x;q,a) denote the weighted count of primes up to xx in the reduced residue class aa modulo qq:

θ(x;q,a)=∑p≤x\p≡a(modq)log⁡p.\theta(x;q,a)=\sum_{\substack{p\le x\p\equiv a\pmod q}}\log p.

Let 0<η≤10<\eta\le 1 and β>0\beta>0 be real numbers. Suppose that XX, YY, and QQ are positive real numbers satisfying

Xη≤Y≤X,Y(log⁡X)β≤Q≤Y.X^\eta\le Y\le X,\qquad \frac{Y}{(\log X)^\beta}\le Q\le Y.

Barban–Davenport–Halberstam conjecture. Under these conditions,

∑q≤Q∑1≤a≤q(a,q)=1∣θ(X+Y;q,a)−θ(X;q,a)−Yϕ(q)∣2≪η,βYQlog⁡X.\sum_{q\le Q}\sum_{\substack{1\le a\le q\\(a,q)=1}}\left|\theta(X+Y;q,a)-\theta(X;q,a)-\frac{Y}{\phi(q)}\right|^2\ll_{\eta,\beta}YQ\log X.

This is a short-interval analogue of the Barban–Davenport–Halberstam theorem for primes in arithmetic progressions. The statement is used as an assumed distributional hypothesis for primes and is not established in the source excerpt.

References

Primary source

Sumit Giri, “Short average distribution of a prime counting function over families of elliptic curves”, arXiv:1609.08549 (2016).

Additional references

5 papers in this index state this conjecture (2011–2016). The statement above is taken from the most recent of them; the others are arXiv:1408.3394, arXiv:1208.0919, arXiv:1206.1585, arXiv:1108.3539.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.