Logarithm laws for unipotent flows, I
Jayadev S. Athreya, Grigorii Margulis

TL;DR
This paper establishes logarithm laws for unipotent flows on the space of lattices, extending classical results and providing measure estimates related to lattice intersections with large volume sets.
Contribution
It introduces new logarithm laws for unipotent flows and a measure estimate analogous to Minkowski's theorem in the geometry of numbers.
Findings
Logarithm laws for unipotent flows are proven.
Measure of lattices avoiding large volume sets is small.
Results apply to one-parameter actions on lattice spaces.
Abstract
We prove analogues of the logarithm laws of Sullivan and Kleinbock-Margulis in the context of unipotent flows. In particular, we obtain results for one-parameter actions on the space of lattices . The key lemma for our results says the measure of the set of unimodular lattices in that does not intersect a `large' volume subset of is `small'. This can be considered as a `random' analogue of the classical Minkowski theorem in the geometry of numbers.
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 · Geometry and complex manifolds · Geometric Analysis and Curvature Flows
