On the error term of a lattice counting problem, II
From MaRDI portal
Publication:5111931
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.
Recommendations
- On rounding error sums related to the circle problem
- scientific article; zbMATH DE number 1995877
- scientific article; zbMATH DE number 1059201
- The average order of an arithmetic function
- Lattice points below algebraic curves
- On a trigonometric sum and its application
- scientific article; zbMATH DE number 749712
- THE SQUARE-FREE DIVISOR PROBLEM
- The Laplace transform of the second moment in the Gauss circle problem
- An additive problem of prime numbers
Cites work
- scientific article; zbMATH DE number 3496288 (Why is no real title available?)
- scientific article; zbMATH DE number 699709 (Why is no real title available?)
- scientific article; zbMATH DE number 194767 (Why is no real title available?)
- Arithmetic tales. Transl. from the French by Véronique Bordellès
- On the distribution of fractional parts of polynomials
- On the error term of a lattice counting problem
Cited in
(6)- scientific article; zbMATH DE number 1059201 (Why is no real title available?)
- Uniform bounds for lattice point counting and partial sums of zeta functions
- A counting result on two-dimension with error terms
- Note on a problem of Ramanujan
- On the error term of a lattice counting problem
- Sums of certain fractional parts
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)
