English

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

Number Theory 2023-04-18 v4 Dynamical Systems Probability

Abstract

We use a method developed by Bj\"orklund and Gorodnik to show a central limit theorem (as TT tends to \infty) for the counting functions #(ΛΩT)\# \left( \Lambda \cap \Omega_T \right) where Λ\Lambda ranges over the space Y2dY_{2d} of symplectic lattices in R2d\mathbb{R}^{2d} (d4d \geqslant 4). Here {ΩT}T\lbrace \Omega_T \rbrace_T is a certain family of bounded domains in R2d\mathbb{R}^{2d} that can be tessellated by means of the action of a diagonal semigroup contained in Sp(2d,R)\mathrm{Sp}(2d, \mathbb{R}). In the process we obtain new LpL^p bounds on a certain height function on Y2dY_{2d} originally introduced by Schmidt.

Keywords

Cite

@article{arxiv.2205.12637,
  title  = {A Central Limit Theorem for Counting Functions Related to Symplectic Lattices and Bounded Sets},
  author = {Kristian Holm},
  journal= {arXiv preprint arXiv:2205.12637},
  year   = {2023}
}

Comments

Contact information updated