SearcharxivSearch

arXiv · 1811.05603

Boundary Braids

Abstract

The n-strand braid group can be defined as the fundamental group of the configuration space of n unlabeled points in a closed disk based at a configuration where all n points lie in the boundary of the disk. Using this definition, the subset of braids that have a representative where a specified subset of these points remain pointwise fixed forms a subgroup isomorphic to a braid group with fewer strands. In this article, we generalize this phenomenon by introducing the notion of boundary braids. A boundary braid is a braid that has a representative where some specified subset of the points remains in the boundary cycle of the disk. Although boundary braids merely form a subgroupoid rather than a subgroup, they play an interesting geometric role in the piecewise Euclidean dual braid complex defined by Tom Brady and the second author. We prove several theorems in this setting, including the fact that the subcomplex of the dual braid complex determined by a specified set of boundary braids metrically splits as the direct metric product of a Euclidean polyhedron and a dual braid complex of smaller rank.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Dougherty, Jon McCammond, Stefan Witzel. 2018-11-14. Boundary Braids. https://doi.org/10.2140/agt.2020.20.3505

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