On the error term of a lattice counting problem, II
Number Theory
2017-09-27 v2
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.
Cite
@article{arxiv.1708.07317,
title = {On the error term of a lattice counting problem, II},
author = {Olivier Bordellès},
journal= {arXiv preprint arXiv:1708.07317},
year = {2017}
}
Comments
6 pages