Pure Braid Group Presentations via Longest Elements

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.