Central limit theorems for lattice point counting on tessellated domains

Abstract

Following the approach of Bjorklund and Gorodnik, we have considered the discrepancy function for lattice point counting on domains that can be nicely tessellated by the action of a diagonal semigroup. We have shown that suitably normalized discrepancy functions for lattice point counting on certain tessellated domains satisfy a non-degenerate central limit theorem. Furthermore, we have also addressed the same problem for affine and congruence lattice point counting, proving analogous non-degenerate central limit theorems for them. The main ingredients of the proofs are the method of cumulants and quantitative multiple mixing estimates.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…