SearcharxivSearch

arXiv · 1802.03561

Inducing Super-Approximation

Abstract

Let $\Gamma_2\subseteq \Gamma_1$ be finitely generated subgroups of ${\rm GL}_{n_0}(\mathbb{Z}[1/q_0])$. For $i=1$ or $2$, let $\mathbb{G}_i$ be the Zariski-closure of $\Gamma_i$ in $({\rm GL}_{n_0})_{\mathbb{Q}}$, $\mathbb{G}_i^{\circ}$ be the Zariski-connected component of $\mathbb{G}_i$, and let $G_i$ be the closure of $\Gamma_i$ in $\prod_{p\nmid q_0}{\rm GL}_{n_0}(\mathbb{Z}_p)$. In this article we prove that, if $\mathbb{G}_1^{\circ}$ is the smallest closed normal subgroup of $\mathbb{G}_1^{\circ}$ which contains $\mathbb{G}_2^{\circ}$ and $\Gamma_2\curvearrowright G_2$ has spectral gap, then $\Gamma_1\curvearrowright G_1$ has spectral gap.

Explore related subjects

Keep this discovery

BibTeXRIS

Alireza Salehi Golsefidy, Xin Zhang. 2018-02-10. Inducing Super-Approximation. https://arxiv.org/abs/1802.03561

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR