An algorithm to classify rational 3-tangles
From MaRDI portal
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.
Recommendations
Cites work
Cited in
(13)- A generalization of the rectangle condition
- The classification of nonsimple algebraic tangles
- The classification of rational subtangle replacements between rational tangles
- Rectangle conditions and families of 3-bridge prime knots
- Properties of Casson-Gordon's rectangle condition
- ON THE CLASSIFICATION OF RATIONAL 3-TANGLES
- On the classification of a large set of rational 3-tangle diagrams
- Minimal number of steps in the Euclidean algorithm and its application to rational tangles
- RESULTS ON THE CLASSIFICATION OF RATIONAL 3-TANGLES
- A classification of (1, 1)-positions
- Uniqueness of reduced alternating rational 3-tangle diagrams
- On detecting the trivial rational 3-tangle
- Normal forms for rational 3-tangles
This page was built for publication: An algorithm to classify rational 3-tangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4982877)