SearcharxivSearch

arXiv · 2310.14632

Artin groups of type (2,3,n)

Abstract

Our main theorem is that the word problem in the Artin group G = for n >= 5 can be solved using a system R of length preserving rewrite rules that, together with free reduction, can be used to reduce any word over {a,b,c} to a geodesic word in $G$, in quadratic time. This result builds on work of Holt and Rees, and of Blasco, Cumplido and Morris-Wright, which proves the same result for all Artin groups that are either sufficiently large or 3-free. Since every rank 3 Artin group is either spherical or in one of the categories covered by the previous results on which we build, it follows that any rank 3 Artin group has quadratic Dehn function. However we note that this and much more is a consequence of very recent work of Haettel and Huang; our contribution is to provide a particular kind or rewriting solution to the word problem for the non-spherical rank 3 Artin groups (and more).

Explore related subjects

Keep this discovery

BibTeXRIS

Derek F. Holt, Sarah Rees. 2023-10-23. Artin groups of type (2,3,n). https://arxiv.org/abs/2310.14632

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