Searching for non-order-preserving braids algorithmically
Authors:
- Jonathan JohnsonJJJonathan Johnson
- Nancy ScherichNSNancy Scherich
- Hannah TurnerHTHannah Turner
Preprint
Abstract
An $n$-strand braid is order-preserving if its action on the free group $F_n$ preserves some bi-order of $F_n$. A braid $β$ is order-preserving if and only if the link $L$ obtained as the union of the closure of $β$ and its axis has bi-orderable complement. We describe and implement an algorithm which, given a non-order-preserving braid $β$, confirms this property and returns a proof that $β$ is indeed not order-preserving. Guided by the algorithm, we prove that the infinite family of simple 3-braids $σ_1σ_2^{2m+1}$ are not order-preserving for any integer $m$.
Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Ordered bases, order-preserving automorphisms and bi-orderable link groupsMathematical Proceedings of the Cambridge Philosophical Society, 2025
- Residual torsion-free nilpotence, biorderability and pretzel knotsAlgebraic & Geometric Topology, 2023
- Residual torsion-free nilpotence, bi-orderability, and two-bridge linksCanadian Journal of Mathematics, 2023
- Floer homology, group orderability, and taut foliations of hyperbolic 3–manifoldsGeometry & Topology, 2020
- Braids, orderings, and minimal volume cusped hyperbolic 3-manifoldsGroups, Geometry, and Dynamics, 2018
- A family of bi-orderable non-fibered 2-bridge knot groupsJournal of Knot Theory and Its Ramifications, 2017
- Testing Bi-orderability of Knot GroupsCanadian Mathematical Bulletin, 2016
- On orderability of fibred knot groupsMathematical Proceedings of the Cambridge Philosophical Society, 2003
- Laminations and groups of homeomorphisms of the circleInventiones Mathematicae, 2003