Uniform congruence counting for Schottky semigroups in $\mathrm{SL}_2(\mathbf{Z})$
Michael Magee, Hee Oh, Dale Winter

TL;DR
This paper establishes a uniform congruence counting theorem for Schottky semigroups in SL(2,Z), providing asymptotic counts with error bounds that are independent of the level q, and applies to continued fractions semigroups related to Zaremba's conjecture.
Contribution
It introduces a uniform counting method for Schottky semigroups in SL(2,Z) that works uniformly across levels q, including applications to continued fractions.
Findings
Proved a uniform asymptotic counting formula for Schottky semigroups.
Established error bounds independent of the level q.
Extended results to continued fractions semigroups related to Zaremba's conjecture.
Abstract
Let be a Schottky semigroup in , and for , let \Gamma(q):=\{\gamma\in \Gamma: \gamma= e \text{ (mod q)}\} be its congruence subsemigroup of level . We prove the following uniform congruence counting theorem with respect to the family of Euclidean norm balls in of radius : for all with no small prime factors, as for some which are independent of . Our technique also applies to give a similar counting result for the continued fractions semigroup of , which arises in the study of Zaremba's conjecture on continued fractions.
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 · Limits and Structures in Graph Theory · Analytic Number Theory Research
