A Central Limit Theorem for Counting Functions Related to Symplectic Lattices and Bounded Sets
Kristian Holm

TL;DR
This paper proves a central limit theorem for counting symplectic lattice points in expanding bounded sets, using a novel method and establishing new bounds on a height function in the space of symplectic lattices.
Contribution
It introduces a new approach to establish a CLT for lattice point counts in symplectic lattices and derives new $L^p$ bounds on a height function.
Findings
Proves a CLT for counting functions in symplectic lattices as T approaches infinity.
Establishes new $L^p$ bounds on a height function on the space of symplectic lattices.
Utilizes a tessellation method via a diagonal semigroup in $ ext{Sp}(2d, eals)$.
Abstract
We use a method developed by Bj\"orklund and Gorodnik to show a central limit theorem (as tends to ) for the counting functions where ranges over the space of symplectic lattices in (). Here is a certain family of bounded domains in that can be tessellated by means of the action of a diagonal semigroup contained in . In the process we obtain new bounds on a certain height function on originally introduced by Schmidt.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · advanced mathematical theories · Stochastic processes and statistical mechanics
