arXiv · 1708.07317
On the error term of a lattice counting problem, II
Abstract
Under the Riemann Hypothesis, we improve the error term in the asymptotic formula related to the counting lattice problem studied in a first part of this work. The improvement comes from the use of Weyl's bound for exponential sums of polynomials and a device due to Popov allowing us to get an improved main term in the sums of certain fractional parts of polynomials.
Explore related subjects
Keep this discovery
Olivier Bordellès. 2017-08-24. On the error term of a lattice counting problem, II. https://arxiv.org/abs/1708.07317
Cite the original work for its findings. Save a collection to share your selection of sources.