Gauss Circle-Problem Exponent Conjecture
Canonical statement
View source LaTeX
For \(R\ge1\), let
\[
P(R)=\#\{(m,n)\in\mathbb Z^2:m^2+n^2\le R^2\}-\pi R^2.
\] Then for every \(\varepsilon>0\),
\[
P(R)=O_\varepsilon(R^{1/2+\varepsilon})
\quad(R\to\infty).
\]Notes
Write for the number of integer lattice points in the disc of radius minus its area . The Gauss circle problem, in its modern sharp form, conjectures that for every . Gauss initiated the counting problem much earlier, with the elementary bound ; the precise exponent conjecture took shape around 1915 in the work of Hardy [Hardy1915Circle].
Hardy showed that genuinely fluctuates on the square-root scale, so the exponent cannot be lowered and the conjecture is optimal apart from the factor [Hardy1915Circle]. On the upper-bound side, a century of refinements of exponential-sum methods has pushed the admissible exponent steadily downward, with Huxley's estimates [Huxley2003Lattice] and the subsequent improvement of Bourgain and Watt [BourgainWatt2017] holding the strongest results; all proved exponents remain strictly greater than . The conjecture is thus open precisely in the range between the best current exponent and , and closing that range appears to require ideas beyond present exponential-sum technology.
References (3)
- [Hardy1915Circle]
On the expression of a number as the sum of two squares
G. H. Hardy · 1915 · misc
- [Huxley2003Lattice]
Exponential sums and lattice points III
Open ↗M. N. Huxley · 2003 · misc
- [BourgainWatt2017]
Mean square of zeta function, circle problem and divisor problem revisited
Open ↗Jean Bourgain and Nigel Watt · 2017 · misc
The boxed statement is the canonical open formulation — not a stronger variant or a related research program. The status reflects the catalog's last review; do your own literature search before investing serious effort.