SearcharxivSearch

arXiv · 2607.04580

Groups Generated by Root Unipotents: Higher-rank and rank-one

Abstract

We study subgroups generated by prescribed unipotent elements. For $n\geq 3$, let \[ \Gamma(Q)=\langle E_{ij}(q_{ij}):i\neq j\rangle \] be the subgroup of $\operatorname{SL}(n,\mathbb R)$ generated by elementary matrices with nonzero rational parameters $q_{ij}$. We prove that $\Gamma(Q)$ is always $S$-arithmetic, extending classical integral-parameter results to arbitrary rational parameters. Our method is effective: it determines the relevant ring of $S$-integers, a diagonal conjugating matrix, and an explicit description of the resulting subgroup by congruence conditions. We then study the rank-one family \[ \Gamma_q= \left\langle \begin{pmatrix} 1&1\\ 0&1 \end{pmatrix}, \begin{pmatrix} 1&0\\ q&1 \end{pmatrix} \right\rangle, \qquad q=\tfrac{s}{t}\in\mathbb Q. \] For $q\neq0,\pm3$, we prove that \[ \Gamma_q=\Gamma_1^{(t)}(s) \] if and only if its upper-triangular subgroup strictly contains \[\left\langle\begin{pmatrix}1&1\\0&1\end{pmatrix}\right\rangle.\] Thus the congruence-subgroup problem is reduced to constructing a single upper-triangular element outside this cyclic subgroup. As applications, we reinterpret several constructions from the study of non-freeness as constructions of arithmetic groups. We verify the criterion for all rational parameters $q=\tfrac{s}{t}\in(-4,4)$ with $1\leq |s|\leq21$, and obtain new infinite families of congruence subgroups from indefinite binary quadratic forms and Pell-type equations.

Explore related subjects

Keep this discovery

BibTeXRIS

Yanlong Hao. 2026-07-06. Groups Generated by Root Unipotents: Higher-rank and rank-one. https://arxiv.org/abs/2607.04580

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