Related papers: Natural Moves for Knots and Links

In this paper, we prove that given two cubical links of dimension two in ${\mathbb R}^4$, they are isotopic if and only if one can pass from one to the other by a finite sequence of cubulated moves. These moves are analogous to the…

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$.

The aim of this paper is to define certain algebraic structures coming from generalized Reidemeister moves of singular knot theory. We give examples, show that the set of colorings by these algebraic structures is an invariant of singular…

We have two results. First, we give 96 generating sets oriented singular Reidemeister moves; it is an answer to a question by Bataineh, Khaled, Elhamdadi, and Hajij who give a generating set of oriented singular Reidemeister moves using…

For classical links Ohyama proved an inequality involving the minimal crossing number and the braid index, then motivated from this Takeda showed an analogous inequality for virtual links. In this paper, we are interested in studying…

We introduce and study knotoids. Knotoids are represented by diagrams in a surface which differ from the usual knot diagrams in that the underlying curve is a segment rather than a circle. Knotoid diagrams are considered up to Reidemeister…

We consider knot theories possessing a {\em parity}: each crossing is decreed {\em odd} or {\em even} according to some universal rule. If this rule satisfies some simple axioms concerning the behaviour under Reidemeister moves, this leads…

We introduce and begin the study of new knot energies defined on knot diagrams. Physically, they model the internal energy of thin metallic solid tori squeezed between two parallel planes. Thus the knots considered can perform the second…

We introduce the non-self OU sequence and the OU number for link diagrams. Using these, we give a lower bound for the number of necessary Reidemeister moves of type III between two diagrams of the same link.

The forbidden moves can be combined with Gauss diagram Reidemeister moves to obtain move sequences with which we may change any Gauss diagram (and hence any virtual knot) into any other, including in particular the unknotted diagram

It is well known that any two diagrams representing the same oriented link are related by a finite sequence of Reidemeister moves O1, O2 and O3. Depending on orientations of fragments involved in the moves, one may distinguish 4 different…

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…

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…

We address here the topological equivalence of knots through the so-called Reidemeister moves. These topology-conserving manipulations are recast into dynamical rules on the crossings of knot diagrams. This is presented in terms of a simple…

In oriented knot theory, verifying a quantity is an invariant involves checking its invariance under all oriented Reidemeister moves, a process that can be intricate and time-consuming. A generating set of oriented moves simplifies this by…

We suggest a new random model for links based on meander diagrams and graphs. We then prove that trivial links appear with vanishing probability in this model, no link $L$ is obtained with probability 1, and there is a lower bound for the…

In this paper we present a systematic method to generate prime knot and prime link minimal triple-point projections, and then classify all classical prime knots and prime links with triple-crossing number at most four. We also extend the…

Polyak proved that all oriented versions of Reidemeister moves for knot and link diagrams can be generated by a set of just four oriented Reidemeister moves, and that no fewer than four oriented Reidemeister moves generate them all. We…

\"Ostlund (2001) showed that all planar isotopy invariants of generic plane curves that are unchanged under cusp moves and triple point moves, and of finite degree (in self-tangency moves) are trivial. Here the term "of finite degree" means…

Recently, the author discovered an interesting class of knot-like objects called free knots. These purely combinatorial objects are equivalence classes of Gauss diagrams modulo Reidemeister moves (the same notion in the language of words…