An algorithm to classify rational 3-tangles
Abstract
A 3-tangle T is the disjoint union of 3 properly embedded arcs in the unit 3-ball; it is called rational if there is a homeomorphism of pairs from (B3,T) to (D2× I,\x1,x2,x3\× I). Two rational 3-tangles T and T' are isotopic if there is an orientation-preserving self-homeomorphism h: (B3, T)→ (B3,T') that is the identity map on the boundary. In this paper, we give an algorithm to check whether or not two rational 3-tangles are isotopic by using a modified version of Dehn's method for classifying simple closed curves on surfaces.
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.