SearcharxivSearch

arXiv · 1910.04230

Morphisms between right-angled Coxeter groups and the embedding problem in dimension two

Abstract

In this article, given two finite simplicial graphs $\Gamma_1$ and $\Gamma_2$, we state and prove a complete description of the possible morphisms $C(\Gamma_1) \to C(\Gamma_2)$ between the right-angled Coxeter groups $C(\Gamma_1)$ and $C(\Gamma_2)$. As an application, assuming that $\Gamma_2$ is triangle-free, we show that, if $C(\Gamma_1)$ is isomorphic to a subgroup of $C(\Gamma_2)$, then the ball of radius $8|\Gamma_1||\Gamma_2|$ in $C(\Gamma_2)$ contains the basis of a subgroup isomorphic to $C(\Gamma_1)$. This provides an algorithm determining whether or not, among two given two-dimensional right-angled Coxeter groups, one is isomorphic to a subgroup of the other.

Explore related subjects

Keep this discovery

BibTeXRIS

Anthony Genevois. 2019-10-09. Morphisms between right-angled Coxeter groups and the embedding problem in dimension two. https://arxiv.org/abs/1910.04230

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