Observed periodicity related to the four-strand Burau representation
Abstract
A long-standing open problem is to determine for which values of n the Burau representation Psin of the braid group Bn is faithful. Following work of Moody, Long-Paton, and Bigelow, the remaining open case is n = 4. One criterion states that Psin is unfaithful if and only if there exists a pair of arcs in the n-punctured disk Dn such that a certain associated polynomial is zero. In this paper, we use a computer search to show that there is no such arc-pair in D4 with 2000 or fewer intersections, thus certifying the faithfulness of Psi4 up to this point. We also investigate the structure of the set of arc-pair polynomials, observing a striking periodicity that holds between those that are, in some sense, 'closest' to zero. This is the first instance known to the authors of a deeper analysis of this polynomial set.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.