arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.00545math.NTmath.DSmath.SP

在SO(n, 1)的Schottky和连分数半群中的同余计数

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

Pratyush Sarkar

AI总结:

本文研究了SO(n, 1)中Schottky和连分数半群的同余计数问题,推广了Magee-Oh-Winter在SL₂(R)中的工作,利用扩展机理和Dolgopyat方法解决高维中的挑战。

摘要:

在本文中,我们关注的两种设置是Γ<SO(n, 1)是一个 Zariski 密度的 Schottky 半群,以及Γ<SL₂(C)是一个 Zariski 密度的连分数半群。在两种设置中,我们为相关的同余子半群证明了一个统一的渐进行为计数公式,将 Magee-Oh-Winter [arXiv:1601.03705] 在SL₂(R)中的工作推广到更高维度。表面上,证明需要两种不同的策略:基于 Bourgain-Gamburd-Sarnak 工作的 Golsefidy-Varjú 扩展机理,以及 Dolgopyat 的方法。然而,在更高维度中存在几个挑战。首先,使用扩展机理需要一个关键输入:返回轨迹子群的 Zariski 密度和完整迹字段性质,这是在 [arXiv:2006.07787] 中新引入的。其次,我们需要调整 Stoyanov 的 Dolgopyat 方法版本以克服一些技术问题,而主要的困难是证明关键输入:局部非可积条件(LNIC)和非集中性质(NCP).

英文摘要:

In this paper, the two settings we are concerned with are $Γ< \operatorname{SO}(n, 1)$ a Zariski dense Schottky semigroup and $Γ< \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ú, 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).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑