A Note on Counting Lattice Points in Bounded Domains
Number Theory
2023-10-19 v3
Abstract
Zeros and poles of -tuple zeta functions, that are defined here implicitly, enable localization onto prime-power -tuples in pair-wise coprime -lattices . As such, the set of all along with their associated zeta functions encode the positive natural numbers . Consequently, counting points of can be implemented in . Exploiting this observation, we derive explicit formulae for counting prime-power -tuples and use them to count lattice points in well-behaved bounded regions in . In particular, we count the lattice points contained in the circle . The counting readily extends to well-behaved bounded regions in .
Keywords
Cite
@article{arxiv.1812.03836,
title = {A Note on Counting Lattice Points in Bounded Domains},
author = {J. LaChapelle},
journal= {arXiv preprint arXiv:1812.03836},
year = {2023}
}