Related papers: Realizing Exterior Cromwell moves on rectangular d…
If a rectangular diagram represents the trivial knot, then it can be deformed into the rectangular diagram with only two vertical edges by a finite sequence of merge operations and exchange operations, without increasing the number of…
We present a sequence of diagrams of the unknot for which the minimum number of Reidemeister moves required to pass to the trivial diagram is quadratic with respect to the number of crossings. These bounds apply both in $S^2$ and in $\R^2$.
We prove that any diagram of the unknot with c crossings may be reduced to the trivial diagram using at most (236 c)^{11} Reidemeister moves. Moreover, every diagram in this sequence has at most (7 c)^2 crossings. We also prove a similar…
There is a positive constant $c_1$ such that for any diagram $D$ representing the unknot, there is a sequence of at most $2^{c_1 n}$ Reidemeister moves that will convert it to a trivial knot diagram, $n$ is the number of crossings in $D$. A…
We present three "hard" diagrams of the unknot. They require (at least) three extra crossings before they can be simplified to the trivial unknot diagram via Reidemeister moves in $\mathbb{S}^2$. Both examples are constructed by applying…
In this paper, a link diagram is said to be minimal if no Reidemeister move I or II can be applied to it to reduce the number of crossings. We show that for an arbitrary diagram D of a link without a trivial split component, a minimal…
Consider a robot that remembers only the starting position and walks along a knot once on a knot diagram, switching every undercrossing it meets until it returns to the starting position. We observe that the robot produces an ascending…
Using unknotting number, we introduce a link diagram invariant of Hass and Nowik type, which changes at most by 2 under a Reidemeister move. As an application, we show that a certain infinite sequence of diagrams of the trivial…
We provide an upper bound on the number of ordered Reidemeister moves required to pass between two diagrams of the same link. This bound is in terms of the number of unordered Reidemeister moves required.
In this paper a classification of Reidemeister moves, which is the most refined, is introduced. In particular, this classification distinguishes some $\Omega_3$-moves that only differ in how the three strands that are involved in the move…
In mathematics, a knot is a single strand of string crossed over itself any number of times, and connected at the ends. The Reidemeister Moves have been proven to be the three core moves necessary to fully untangle a knot. Some knots can be…
We provide an explicit upper bound on the number of Reidemeister moves required to pass between two diagrams of the same link. This leads to a conceptually simple solution to the equivalence problem for links.
We first prove that, infinitely many pairs of trivial knot diagrams that are transformed into each other by applying Reidemeister moves I and III are NOT transformed into each other by a sequence of the Reidemeister moves I that increase…
We show that every knot type admits a pair of diagrams that cannot be made identical without using Reidemeister Omega_2-moves. We also show that our proof is compatible with known results for the other move types, in the sense that every…
We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal number of Reidemeister moves needed to pass between certain pairs of knot diagrams.
This note has an experimental nature and contains no new theorems. We introduce certain moves for classical knot diagrams that for all the very many examples we have tested them on give a monotonic complete simplification. A complete…
We introduce an up-down coloring of a virtual-link diagram. The colorabilities give a lower bound of the minimum number of Reidemeister moves of type II which are needed between two 2-component virtual-link diagrams. By using the notion of…
Rotational tangle diagrams have been proven to be extremely important in the study of quantum invariants, as they provide a natural passage between topology and quantum algebra. In this paper, we give a detailed description of several…
Deformations of knots and links in ambient space can be studied combinatorially on their diagrams via local modifications called Reidemeister moves. While it is well-known that, in order to move between equivalent diagrams with Reidemeister…
Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram…