On the error term of a lattice counting problem, II

From MaRDI portal
Publication:5111931

DOI10.1142/S179304212050058XzbMATH Open1476.11111arXiv1708.07317OpenAlexW2995276976MaRDI QIDQ5111931FDOQ5111931

Olivier Bordellès

Publication date: 27 May 2020

Published in: International Journal of Number Theory (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1708.07317




Recommendations




Cites Work


Cited In (4)





This page was built for publication: On the error term of a lattice counting problem, II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111931)