Bounding the number of lattice points near a convex curve by curvature
From MaRDI portal
Publication:6187380
Abstract: We prove explicit bounds on the number of lattice points on or near a convex curve in terms of geometric invariants such as length, curvature, and affine arclength. In several of our results we obtain the best possible constants. Our estimates hold for lattices more general than the usual lattice of integral points in the plane.
Recommendations
Cites work
- scientific article; zbMATH DE number 3289061 (Why is no real title available?)
- A Cantor-Lebesgue theorem for double trigonometric series
- Arcs containing no three lattice points
- Close lattice points on circles
- From Triangles to Manifolds
- Starting with gaps between k-free numbers
- The Distribution of Fractional Parts with Applications to Gap Results in Number Theory
- The integer points close to a curve
- The number of lattice points on a convex curve
This page was built for publication: Bounding the number of lattice points near a convex curve by curvature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187380)