A central limit theorem for counting functions related to symplectic lattices and bounded sets

DOI10.3934/dcds.2023062arXiv2205.12637OpenAlexW4380992603MaRDI QIDQ6165943

Kristian Holm

Publication date: 2 August 2023

Published in: Discrete and Continuous Dynamical Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.12637

zbMATH Keywords

symplectic groupexponential mixingspace of lattices

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Lattice points in specified regions (11P21) Diophantine approximation in probabilistic number theory (11K60) Mean value and transfer theorems (11H60)

Cites Work

• Unnamed Item
• Unnamed Item
• Upper bounds and asymptotics in a quantitative version of the Oppenheim conjecture
• Central limit theorems for group actions which are exponentially mixing of all orders
• Central limit theorems for generic lattice point counting
• Quantitative multiple mixing
• Central limit theorems for Diophantine approximants
• Asymptotic formulae for point lattices of bounded determinant and subspaces of bounded height
• A mean value theorem in geometry of numbers
• Mean values over the space of lattices
• A Metrical Theorem In Geometry of Numbers
• CUMULANTS AND PARTITION LATTICES1
• The Second Moment of the Siegel Transform in the Space of Symplectic Lattices
• AN EXTENSION OF A THEOREM OF HLAWKA
• Lie groups beyond an introduction

This page was built for publication: A central limit theorem for counting functions related to symplectic lattices and bounded sets