Central limit theorems in the geometry of numbers
classification
🧮 math.NT
math.DSmath.PR
keywords
centrallimitlatticenumbertheoremapproximantsapproximationarguments
read the original abstract
We investigate in this paper the distribution of the discrepancy of various lattice counting functions. In particular, we prove that the number of lattice points contained in certain domains defined by products of linear forms satisfies a Central Limit Theorem. Furthermore, we show that the Central Limit Theorem holds for the number of rational approximants for weighted Diophantine approximation in $\mathbb{R}^d$. Our arguments exploit chaotic properties of the Cartan flow on the space of lattices.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.