Pairs in discrete lattice orbits with applications to Veech surfaces
Claire Burrin, Samantha Fairchild, Jon Chaika

TL;DR
This paper develops a new integral formula for counting pairs of vectors in discrete orbits related to Veech surfaces, leading to effective counting results and disjointness properties of translation flows.
Contribution
It introduces a Siegel–Veech-type integral formula for orbit pairs and applies it to derive counting estimates and flow disjointness results on Veech surfaces.
Findings
Effective count of saddle connection vectors in generic sets.
Upper bounds on pairs with bounded determinant or distance.
Disjointness of translation flows for almost every pair of directions.
Abstract
Let , be two discrete orbits under the linear action of a lattice on the Euclidean plane. We prove a SiegelVeech-type integral formula for the averages from which we derive new results for the set of holonomy vectors of saddle connections of a Veech surface . This includes an effective count for generic Borel sets with respect to linear transformations, and upper bounds on the number of pairs in with bounded determinant and on the number of pairs in with bounded distance. This last estimate is used in the appendix to prove that for almost every the translations flows and on any Veech surface are disjoint.
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 · Geometric and Algebraic Topology · Geometric Analysis and Curvature Flows
