2000 character limit reached
Central limit theorems in the geometry of numbers
Published 28 Jun 2017 in math.NT, math.DS, and math.PR | (1706.09218v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.