SearcharxivSearch

arXiv · 2605.12300

Quasiisometric embeddings between right-angled Artin groups: rigidity

Abstract

By introducing branching conditions on the defining graph, we prove a range of rigidity results for quasiisometric embeddings between right-angled Artin groups. The starting point for these is that, under mild conditions on the codomain, the branching conditions imply that a quasiisometric embedding induces an embedding between the associated extension graphs. Among other things, we: (1) provide obstructions to the existence of quasiisometric embeddings into products of trees; (2) prove that if the direct product $F_2^n\times A_{C_5}^m$ can be quasiisometrically embedded in a RAAG of the same dimension, then this can be seen from its defining graph; (3) classify all self--quasiisometric-embeddings of RAAGs defined on cycles; (4) show that no $n$--dimensional RAAG is a universal receiver for quasiisometric embeddings of $n$--dimensional RAAGs. We also establish a strong rigidity theorem for the quasiisometric images of 2--flats in RAAGs defined by triangle-free graphs that are not stars, generalising a theorem of Bestvina--Kleiner--Sageev.

Explore related subjects

Keep this discovery

BibTeXRIS

Shaked Bader, Oussama Bensaid, Harry Petyt. 2026-05-12. Quasiisometric embeddings between right-angled Artin groups: rigidity. https://arxiv.org/abs/2605.12300

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