An algorithm to classify rational 3-tangles
Bo-hyun Kwon

TL;DR
This paper presents an algorithm for determining whether two rational 3-tangles are isotopic, utilizing a modified Dehn's method to classify simple closed curves on surfaces, advancing the classification techniques in knot theory.
Contribution
It introduces a novel algorithm that effectively checks isotopy of rational 3-tangles using a modified Dehn's approach, enhancing classification methods.
Findings
Algorithm successfully distinguishes non-isotopic rational 3-tangles.
Provides a practical method for classifying rational 3-tangles.
Advances the computational tools in knot and tangle theory.
Abstract
A - is the disjoint union of properly embedded arcs in the unit 3-ball; it is called rational if there is a homeomorphism of pairs from to . Two rational 3-tangles and are isotopic if there is an orientation-preserving self-homeomorphism 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Mathematical Dynamics and Fractals · Computational Geometry and Mesh Generation
