Searching for non-order-preserving braids algorithmically

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 $\beta$ is order-preserving if and only if the link $L$ obtained as the union of the closure of $\beta$ and its axis has bi-orderable complement. We describe and implement an algorithm which, given a non-order-preserving braid $\beta$, confirms this property and returns a proof that $\beta$ is indeed not order-preserving. Guided by the algorithm, we prove that the infinite family of simple 3-braids $\sigma_1\sigma_2^{2m+1}$ are not order-preserving for any integer $m$.