Related papers: Minimal generating sets of Reidemeister moves

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…

We determine whether each known generating set of arbitrary oriented Reidemeister moves is minimal. We then provide a complete classification of minimal generating sets that include a coherent Reidemeister move of type II. We also classify…

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…

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…

Singular knot theory extends classical knot theory by allowing transverse double points without over/under information, together with singular Reidemeister moves of types IV and V. A central open problem in this theory is to determine the…

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 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…

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.

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…

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…

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…

We derive a minimal generating set of planar moves for diagrams of surfaces embedded in the four-space. These diagrams appear as the bonded classical unlink diagrams.

Given an algebra $F[H]^G$ of polynomial invariants of an action of the group $G$ over the vector space $H$, a subset $S$ of $F[H]^G$ is called separating if $S$ separates all orbits that can be separated by $F[H]^G$. A minimal separating…

The algebra of invariants of several 3 x 3 matrices under the action of the orthogonal group by simultaneous conjugation is considered over a field of characteristic different from two. The maximal degree of elements of minimal system of…

This chapter provides a comprehensive survey of foundational results and recent advances concerning minimal generating sets for the mapping class group of a nonorientable surface, $\mathrm{Mod}(N_{g})$, and its index-two twist subgroup,…

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…

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.

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…

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