SearcharxivSearch

arXiv · 2606.21817

Bounded elementary generation of SL_2: nearly the end

Abstract

Let $\mathcal{O}_S$ be the ring of $S$-integers of a global field $K$ of any characteristic, where $S$ is a finite set of valuations of $K$ (and $S$ contains all of the archimedean valuations if the characteristic is zero). We prove that if $|S| \ge 2$, then every unimodular $(2 \times 2)$-matrix over $\mathcal{O}_S$ is a product of $\leq 7$ elementary matrices. This nearly optimal bound essentially concludes the investigation of bounded elementary generation of $SL_2(\mathcal{O}_S)$ started over 50 years ago.

Explore related subjects

Keep this discovery

BibTeXRIS

B. E. Kunyavskii, D. W. Morris, A. S. Rapinchuk. 2026-06-20. Bounded elementary generation of SL_2: nearly the end. https://arxiv.org/abs/2606.21817

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