SearcharxivSearch

arXiv · 1905.08326

Planar pure braids on six strands

Abstract

The group of planar (or flat) pure braids on $n$ strands, also known as the pure twin group, is the fundamental group of the configuration space $F_{n,3}(\mathbb{R})$ of $n$ labelled points in $\mathbb{R}$ no three of which coincide. The planar pure braid groups on 3, 4 and 5 strands are free. In this note we describe the planar pure braid group on 6 strands: it is a free product of the free group on 71 generators and 20 copies of the free abelian group of rank two.

Explore related subjects

Keep this discovery

BibTeXRIS

Jacob Mostovoy, Christopher Roque-Márquez. 2019-05-20. Planar pure braids on six strands. https://doi.org/10.1142/s0218216519500974

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