Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 25 May 2022 in math.NT, math.DS, and math.PR | (2205.12637v4)

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

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.