Realizing exterior Cromwell moves on rectangular diagrams by Reidemeister moves
From MaRDI portal
(Redirected from Publication:2878656)
Abstract: If a rectangular diagram represents the trivial knot, then it can be deformed into the trivial rectangular diagram with only four edges by a finite sequence of merge operations and exchange operations, without increasing the number of edges, which was shown by I. A. Dynnikov. Using this, Henrich and Kauffman gave an upper bound for the number of Reidemeister moves needed for unknotting a knot diagram of the trivial knot. However, exchange or merge moves on the top and bottom pairs of edges of rectangular diagrams are not considered in the proof. In this paper, we show that there is a rectangular diagram of the trivial knot which needs such an exchange move for being unknotted, and study upper bound of the number of Reidemeister moves needed for realizing such an exchange or merge move.
Recommendations
Cites work
Cited in
(8)- When can a link be obtained from another using crossing exchanges and smoothings?
- Algorithmic simplification of knot diagrams: new moves and experiments
- Unknotting rectangular diagrams of the trivial knot by exchange moves
- An upper bound on Reidemeister moves
- Rectangular Seifert circles and arcs system
- THE PROBLEM OF DETECTING THE SATELLITE STRUCTURE OF A LINK BY MONOTONIC SIMPLIFICATION
- Multiflypes of rectangular diagrams of links
- New presentations of a link and virtual link
This page was built for publication: Realizing exterior Cromwell moves on rectangular diagrams by Reidemeister moves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2878656)