A Note on Counting Lattice Points in Bounded Domains

From MaRDI portal
Publication:6310962

arXiv1812.03836MaRDI QIDQ6310962FDOQ6310962


Authors: J. Lachapelle Edit this on Wikidata


Publication date: 5 December 2018

Abstract: k-tuple zeta functions localize prime-power k-tuples in the pair-wise coprime k-lattices mathfrakNk. As such, the set of all mathfrakNk along with their associated zeta functions encode the natural numbers mathbbN, and so mathbbZgeq0 can be represented by projection from the mathfrakNk onto mathbbR+. Accordingly, counting points of mathbbZgeq0 can be implemented in mathfrakNk. Exploiting this observation, we derive explicit formulae for counting prime-power k-tuples and use them to count lattice points in well-behaved bounded regions in mathbbR2. In particular, we count the lattice points contained in the circle S1. The counting readily extends to well-behaved bounded regions in mathbbRn.













This page was built for publication: A Note on Counting Lattice Points in Bounded Domains

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