Abstract
An [ ]-strand braid is order-preserving if its action on the free group [ ] preserves some bi-order of [ ]. A braid [ ] is order-preserving if and only if the link [ ] 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 [ ] are not order-preserving for any integer [ ].
Funding Information
  • NSF grant (DMS-2213213)
  • AMS-Simons travel grant and NSF grant (DMS-2532699)
  • NSF grant (DMS-1745583)