arXiv research

Minimal sets of moves for isotopic knots and trivalent graphs identified.

This study simplifies verification of invariants in oriented virtual knots.

In this note we present a short proof that the 4 oriented Reidemeister moves of type 2 together with any one of the 8 oriented Reidemeister moves of type 3 are sufficient to imply the other 7.

Minimal sets of moves for rotational Reidemeister diagrams are identified.

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 versions of each of the O1 and O2 moves, and 8 versions of the O3 move. We introd…

Polyak proved that the set $\{\Omega1a,\Omega1b,\Omega2a,\Omega3a\}$ is a minimal generating set of oriented Reidemeister moves. One may distinguish between forward and backward moves, obtaining $32$ different types of moves, which we call directed oriented Reidemeister moves. In this article we prove that the set of $…

New moves for singular knots identified and described.

Minimal generating sets of Reidemeister moves identified and classified.

A star-like isotopy for oriented links in 3-space is an isotopy which uses only Reidemeister II moves with opposite orientations and Reidemeister III moves with alternating orientations when checking the strands clockwise (or anticlockwise). We define a link polynomial derived from the Jones polynomial which is, in gen…

We introduce \textit{Niebrzydowski algebras}, algebraic structures with a ternary operation and a partially defined multiplication, with axioms motivated by the Reidemeister moves for $Y$-oriented trivalent spatial graphs and handlebody-links. As part of this definition, we identify generating sets of $Y$-oriented Reid…

We give a generating set of the generalized Reidemeister moves for oriented singular links. We use it to introduce an algebraic structure arising from the study of oriented singular knots. We give some examples, including some non-isomorphic families of such structures over non-abelian groups. We show that the set of c…

Enhances knot and link invariant using tribracket modules.

Paper solves the minimal generating set problem for singular Reidemeister moves.

Extends knot polynomial to knotted 4-valent graphs.

Study uses knot theory to model RNA foldings, emphasizing both entanglement and intrachain interactions.

Both classical and virtual knots arise as formal Gauss diagrams modulo some abstract moves corresponding to Reidemeister moves. If we forget about both over/under crossings structure and writhe numbers of knots modulo the same Reidemeister moves, we get a dramatic simplification of virtual knots, which kills all classi…

Parity functors assign labels to knot diagrams based on crossing parity.

Knots in circle bundles are uniquely identified by their complements.

Algorithm for recognizing and performing Reidemeister moves in Gauss diagrams.

In the present paper we give a simple proof of the fact that the set of virtual links with orientable atoms is closed. More precisely, the theorem states that if two virtual diagrams $K$ and $K'$ have orientable atoms and they are equivalent by Reidemeister moves, then there is a sequence of diagrams $K = K_1 \to...\to…

Innovative rack theory applied to Legendrian links.

New categorified knot invariant from quandle colorings.

New sequences prove some link diagrams can't be transformed by specific moves.

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 similar result holds for elementary moves on a polygonal knot $K$ embedded in t…

Calculates lower bounds for type III Reidemeister moves in link diagrams.

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.

New moves prove crossing number sum for knots.

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 a quandle cocycle invariant, we determine the necessity of Reidemeister moves of…

We introduce \textit{dual graph diagrams} representing oriented knots and links. We use these combinatorial structures to define corresponding algebraic structures we call \textit{biquasiles} whose axioms are motivated by dual graph Reidemeister moves, generalizing the Dehn presentation of the knot group analogously to…

Khovanov and Rozansky's categorification of the HOMFLY-PT polynomial is invariant under braidlike isotopies for any link diagram and Markov moves for braid closures. To define HOMFLY-PT homology, they required a link to be presented as a braid closure, because they did not prove invariance under the other oriented Reid…

A braid-like isotopy for links in 3-space is an isotopy which uses only those Reidemeister moves which occur in isotopies of braids. We define a refined Jones polynomial and its corresponding Khovanov homology which are, in general, only invariant under braid-like isotopies.

New groups defined from knot diagrams, invariant under Reidemeister moves.

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 two-component link need quadratic number of Reidemeister moves for being unknotted with resp…

As Oleg Viro describes in his paper, the most fundamental property of the Khovanov homology group is their invariance under Reidemeister moves. Viro constructes Khovanov complex and homology consisting of Jordan curves with sign and also gives a proof for the only case of first Reidemeister move by using his definition…

Parallelization technique for welded links preserves equivalence and yields specific decompositions.

New moves help untangle complex knots.

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 diagram obtained by applying Reidemeister moves I and II to D is unique. The proof al…

We study the number of Reidemeister type III moves using Fox n-colorings of knot diagrams.

32 knot projections classified based on forbidden Reidemeister moves.

Functorial maps and weak parities are equivalent descriptions of rules of substitution virtual crossings for classical in diagrams of a knot in a way compatible with Reidemeister moves. We introduce the notion of maximal weak parity and describe it for knots in a given closed oriented surface. This weak parity defines …

Polynomial bound on Reidemeister moves for each link type.

The H(n)-move simplifies virtual and welded knots and links.

We show that any two diagrams of the same knot or link are connected by a sequence of Reidemeister moves which are sorted by type.

Study of equivariant movie moves for involutive links.

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 theorem for split links, which provides a polynomial upper bound on the number of …

Paper defines weak (1, 3) homotopy for knot projections and classifies trivial knots.

The paper shows that knot projections without triple chords can be simplified.

New homotopy types and invariants defined for knots.