SearcharxivSearch

arXiv · 1411.1028

Braid groups and euclidean simplices

Abstract

When Daan Krammer and Stephen Bigelow independently proved that braid groups are linear, they used the Lawrence-Krammer-Bigelow representation for generic values of its variables q and t. The t variable is closely connected to the traditional Garside structure of the braid group and plays a major role in Krammer's algebraic proof. The q variable, associated with the dual Garside structure of the braid group, has received less attention. In this article we give a geometric interpretation of the q portion of the LKB representation in terms of an action of the braid group on the space of non-degenerate euclidean simplices. In our interpretation, braid group elements act by systematically reshaping (and relabeling) euclidean simplices. The reshapings associated to the simple elements in the dual Garside structure of the braid group are of an especially elementary type that we call relabeling and rescaling.

Explore related subjects

Keep this discovery

BibTeXRIS

Elizabeth Leyton Chisholm, Jon McCammond. 2014-11-04. Braid groups and euclidean simplices. https://arxiv.org/abs/1411.1028

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