Multiplicative Diophantine approximation and bounds for lattice sums
M.M.Skriganov
TL;DR
This paper investigates bounds for lattice sums related to counting integer points within polyhedra, contributing to the understanding of Diophantine approximation in a multiplicative setting.
Contribution
It provides new estimates for lattice sums that improve the bounds used in counting integer points in polyhedral regions.
Findings
Derived bounds for lattice sums in polyhedral counting problems
Enhanced understanding of multiplicative Diophantine approximation
Potential applications to number theory and discrete geometry
Abstract
We estimate the lattice sums arising in the context of the integer point counting in polyhedra.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.