The bounded short-arc lattice-point conjecture

About 20 years old · traced to

For an integer nn, count integer points on the circle a2+b2=na^2+b^2=n whose second coordinate lies in a short interval. The short-arc lattice-point conjecture. For every α<1/2\alpha<1/2, there is a constant CαC_\alpha such that, for every NN,

#{(a,b):a2+b2=n, N≤∣b∣<N+nα}≤Cα.\#\{(a,b):a^2+b^2=n,\ N\le |b|<N+n^\alpha\}\le C_\alpha.

The source says this is proved for α≤1/4\alpha\le1/4 but remains open for α>1/4\alpha>1/4.

References

Primary source

Javier Cilleruelo and Andrew Granville, “Lattice points on circles, squares in arithmetic progressions and sumsets of squares”, arXiv:math/0608109 (2006).

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.