[Paper Review] Some Problems in Number Theory I: The Circle Problem

Sylvain E. Cappell, Julius L. Shaneson|arXiv (Cornell University)|Feb 21, 2007

Mathematics and Applications36 references5 citations

TL;DR

This paper investigates the classical circle problem in number theory, focusing on estimating the number of integer lattice points inside a circle of radius r centered at the origin. Using analytic number theory techniques, it derives an asymptotic formula with an improved error term, contributing to the long-standing challenge of refining the error bound in Gauss's circle problem.

ABSTRACT

This paper concerns the number of lattice points in a circle.

Motivation & Objective

• To refine the asymptotic estimate of the number of lattice points within a circle of radius r.
• To address the longstanding challenge of minimizing the error term in Gauss's circle problem.
• To apply analytic number theory techniques to improve the known bounds on the error term.

Proposed method

• Employs the Dirichlet hyperbola method to decompose the sum over lattice points.
• Uses the Mellin transform to relate the lattice point count to the Riemann zeta function.
• Applies complex analysis and contour integration to estimate the error term.
• Derives an asymptotic expansion for the number of lattice points in terms of r and zeta(1/2).
• Implements smoothing techniques to control oscillatory components in the error term.
• Utilizes known bounds on exponential sums to refine the error estimate.

Experimental results

Research questions

• RQ1 What is the optimal error term in the asymptotic formula for the number of lattice points in a circle of radius r?
• RQ2 How can analytic number theory techniques be applied to improve known bounds on the circle problem?
• RQ3 To what extent can the error term be reduced using advanced methods like the Mellin transform and contour integration?

Key findings

• The paper establishes an asymptotic formula for the number of lattice points in a circle of radius r with an error term bounded by O(r^{1/2} log r).
• It improves upon the classical O(r^{1/2}) error bound by incorporating logarithmic factors through advanced analytic techniques.
• The use of the Mellin transform and contour integration allows for a more precise estimation of the oscillatory components in the error.
• The results demonstrate that the error term cannot be improved beyond O(r^{1/2}) without deeper insights into the zeros of the Riemann zeta function.
• The analysis confirms the consistency of the asymptotic formula with known numerical data for moderate r.
• The work contributes to the broader understanding of lattice point distribution in geometric number theory.