Congruence counting in Schottky and continued fractions semigroups of $\operatorname{SO}(n, 1)$

TL;DR

This paper establishes a uniform asymptotic counting formula for congruence subsemigroups in Zariski dense Schottky and continued fractions semigroups within (n, 1) and _2(\u2102), extending prior work to higher dimensions using advanced expander and Dolgopyat techniques.

Contribution

It introduces new methods to prove counting formulas in higher-dimensional semigroups, overcoming technical challenges with Zariski density and trace field properties.

Findings

Established uniform asymptotic counting formulas for higher-dimensional semigroups.

Extended prior (2) results to (n, 1) and _2() settings.

Developed new adaptations of Dolgopyat's method for higher-dimensional cases.

Abstract

In this paper, the two settings we are concerned with are $\Gamma < \operatorname{SO}(n, 1)$ a Zariski dense Schottky semigroup and $\Gamma < \operatorname{SL}_2(\mathbb C)$ a Zariski dense continued fractions semigroup. In both settings, we prove a uniform asymptotic counting formula for the associated congruence subsemigroups, generalizing the work of Magee-Oh-Winter [arXiv:1601.03705] in $\operatorname{SL}_2(\mathbb R)$ to higher dimensions. Superficially, the proof requires two separate strategies: the expander machinery of Golsefidy-Varj\'u, based on the work of Bourgain-Gamburd-Sarnak, and Dolgopyat's method. However, there are several challenges in higher dimensions. Firstly, using the expander machinery requires a key input: the Zariski density and full trace field property of the return trajectory subgroups, newly introduced in [arXiv:2006.07787]. Secondly, we need to adapt Stoyanov's version of Dolgopyat's method to circumvent some technical issues while the main difficulty is to prove the key inputs: the local non-integrability condition (LNIC) and the non-concentration property (NCP).