SearcharxivSearch

arXiv · 1901.06704

On the finiteness length of some soluble linear groups

Abstract

Given a commutative unital ring $R$, we show that the finiteness length of a group $G$ is bounded above by the finiteness length of the Borel subgroup of rank one $\mathbf{B}_2^\circ(R)=\left( \begin{smallmatrix} * & * \\ 0 & * \end{smallmatrix} \right)\leq\mathrm{SL}_2(R)$ whenever $G$ admits certain $R$-representations with metabelian image. Combined with results due to Bestvina--Eskin--Wortman and Gandini, this gives a new proof of (a generalization of) Bux's equality on the finiteness length of $S$-arithmetic Borel groups. We also give an alternative proof of an unpublished theorem due to Strebel, characterizing finite presentability of Abels' groups $\mathbf{A}_n(R) \leq \mathrm{GL}_n(R)$ in terms of $n$ and $\mathbf{B}_2^\circ(R)$. This generalizes earlier results due to Remeslennikov, Holz, Lyul'ko, Cornulier--Tessera, and points out to a conjecture about the finiteness length of such groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Yuri Santos Rego. 2019-01-20. On the finiteness length of some soluble linear groups. https://doi.org/10.4153/s0008414x21000213

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