SearcharxivSearch

arXiv · 2608.30881

Quasi-isometries between graphs of totally disconnected locally compact groups

Abstract

Let $G$ and $H$ be compactly generated totally disconnected locally compact (tdlc) groups that decompose as finite graphs of tdlc groups $(\mathcal{G}, \mathcal{A})$ and $(\mathcal{H}, \mathcal{B})$ such that all edge groups are compact and all vertex groups have at most one end. We generalize a result of Papasoglu--Whyte to tdlc groups and show that $G$ and $H$ are quasi-isometric if and only if they have the same number of ends and every one-ended vertex group of $(\mathcal{G}, \mathcal{A})$ is quasi-isometric to a one-ended vertex group of $(\mathcal{H}, \mathcal{B})$, and vice versa. As an application, we construct uncountably many pairwise non-quasi-isometric compactly generated non-discrete simple tdlc groups, strengthening a result by Smith.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sebastian Giersbach. 2026-08-31. Quasi-isometries between graphs of totally disconnected locally compact groups. https://arxiv.org/abs/2608.30881

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