SearcharxivSearch

arXiv · 2109.02815

The planar pure braid group is a diagram group

Abstract

A planar pure braid consists of $n$ descending smooth arcs, each connecting a point on one horizontal line $\ell_{1}$ to a point on a horizontal line $\ell_{2}$, which is required to be directly below the first point. Two arcs are allowed to cross, but no threefold intersections are allowed. The set $Γ_{n}$ of all planar pure braids on $n$ strands is a group with respect to a natural stacking operation. We show that $Γ_{n}$ is always a diagram group, in the sense of Guba and Sapir. A number of consequences follow, including biautomaticity and bi-orderability of the groups $Γ_{n}$. Moreover, each group $Γ_{n}$ acts properly and cocompactly on a CAT(0) cubical complex. (The current version corrects a typographical error and acknowledges overlap with earlier work of Genevois.)

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniel S. Farley. 2021-09-10. The planar pure braid group is a diagram group. https://arxiv.org/abs/2109.02815

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