Pure braid group presentations via longest elements
From MaRDI portal
Publication:6038495
Abstract: This paper gives a new, simplified presentation of the classical pure braid group. The generators are given by the squares of the longest elements over connected subgraphs, and we prove that the only relations are either commutators or certain palindromic length 5 box relations. This presentation is motivated by twist functors in algebraic geometry, but the proof is entirely Coxeter-theoretic. We also prove that the analogous set does not generate for all Coxeter arrangements, which in particular answers a question of Donovan and Wemyss.
Recommendations
- Presentation of pure braid groups
- The pure braid groups and their relatives
- GEOMETRIC PRESENTATIONS FOR THE PURE BRAID GROUP
- Explicit Presentations for Exceptional Braid Groups
- Pure braid group representations of low degree.
- scientific article; zbMATH DE number 4095762
- A generalized Desargues configuration and the pure braid group
- The \(D_ n\) generalized pure braid group
- Presentations of graph braid groups.
- Groupes des tresses et éléments rÉguliers
Cites work
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 1176965 (Why is no real title available?)
- Braid groups and Kleinian singularities
- Braids: a survey
- GEOMETRIC PRESENTATIONS FOR THE PURE BRAID GROUP
- Palindromic braids.
- Presentation of pure braid groups
- THE BRAID GROUP AND OTHER GROUPS
- The braid groups of \(E^ 2\) and \(S^ 2\)
- The liftable mapping class group of balanced superelliptic covers
- Theory of braids
- Twists and braids for general 3-fold flops
Cited in
(3)
This page was built for publication: Pure braid group presentations via longest elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6038495)