SearcharxivSearch

arXiv · 1803.00416

Embeddability and quasi-isometric classification of partially commutative groups

Abstract

The main goal of this note is to suggest an algebraic approach to the quasi-isometric classification of partially commutative groups (alias right-angled Artin groups). More precisely, we conjecture that if the partially commutative groups $\mathbb{G}(Δ)$ and $\mathbb{G}(Γ)$ are quasi-isometric, then $\mathbb{G}(Δ)$ is a (nice) subgroup of $\mathbb{G}(Γ)$ and vice-versa. We show that the conjecture holds for all known cases of quasi-isometric classification of partially commutative groups, namely for the classes of $n$-tress and atomic graphs. As in the classical Mostow rigidity theory for irreducible lattices, we relate the quasi-isometric rigidity of the class of atomic partially commutative groups with the algebraic rigidity, that is with the co-Hopfian property of their $\mathbb{Q}$-completions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Montserrat Casals-Ruiz. 2018-03-01. Embeddability and quasi-isometric classification of partially commutative groups. https://doi.org/10.2140/agt.2016.16.597

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