SearcharxivSearch

arXiv · 2303.09504

The Artin monoid Cayley graph

Abstract

In this paper we investigate properties of the Artin monoid Cayley graph. This is the Cayley graph of an Artin group $A_\Gamma$ with respect to the (infinite) generating set given by the associated Artin monoid $A^+_\Gamma$. In a previous paper, the first three authors introduced a monoid Deligne complex and showed that this complex is contractible for all Artin groups. In this paper, we show that the Artin monoid Cayley graph is quasi-isometric to a modification of the Deligne complex for $A_\Gamma$ obtained by coning off translates of the monoid Deligne complex. We then address the question of when the monoid Cayley graph has infinite diameter. We conjecture that this holds for all Artin groups of infinite type. We give a set of criteria that imply infinite diameter, and using existing solutions to the word problem for large-type Artin groups and 3-free Artin groups, we prove that the conjecture holds for any Artin group containing a 3-generator subgroup of one of these two types.

Explore related subjects

Keep this discovery

BibTeXRIS

Rachael Boyd, Ruth Charney, Rose Morris-Wright, Sarah Rees. 2023-03-16. The Artin monoid Cayley graph. https://arxiv.org/abs/2303.09504

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