Central limit theorems in the geometry of numbers

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.Comment: 12 pages, 0 figures. Announcement: Details will be published later. Comments are welcome