2000 character limit reached
Counting saddle connections in a homology class modulo $q$
Published 3 Sep 2018 in math.DS and math.NT | (1809.00579v1)
Abstract: We give effective estimates for the number of saddle connections on a translation surface that have length $\leq L$ and are in a prescribed homology class modulo $q$. Our estimates apply to almost all translation surfaces in a stratum of the moduli space of translation surfaces, with respect to the Masur-Veech measure on the stratum.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.