Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Note on Counting Lattice Points in Bounded Domains

Published 5 Dec 2018 in math.NT | (1812.03836v3)

Abstract: Zeros and poles of $k$-tuple zeta functions, that are defined here implicitly, enable localization onto prime-power $k$-tuples in pair-wise coprime $k$-lattices $\mathfrak{N}k$. As such, the set of all $\mathfrak{N}_k$ along with their associated zeta functions encode the positive natural numbers $\mathbb{N}{>1}$. Consequently, counting points of $\mathbb{Z}_{\geq0}$ can be implemented in ${\mathfrak{N}_k}$. 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 $\mathbb{R}2$. In particular, we count the lattice points contained in the circle $S1$. The counting readily extends to well-behaved bounded regions in $\mathbb{R}n$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.