Related papers: When is region crossing change an unknotting opera…

We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an…

Any knot diagram can be transformed into the unknot by a series of unknotting operations. This paper introduces the diagonal move, a novel unknotting operation that generalizes and unifies several existing moves. We prove that the diagonal…

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…

In this paper we propose {\it a region choice problem} for a knot projection. This problem is an integral extension of Shimizu's 'region crossing change unknotting operation.' We show that there exists a solution of the region choice…

We prove that the crossing changes, Delta moves, and sharp moves are unknotting operations on welded knots.

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…

Unknotting numbers for torus knots and links are well known. In this paper, we present a method for determining the position of unknotting number crossing changes in a toric braid B(p, q) such that the closure of the resultant braid is…

It is known that the unknotting number $u(L)$ of a link $L$ is less than or equal to half the crossing number $c(L)$ of $L$. We show that there are a planar graph $G$ and its spatial embedding $f$ such that the unknotting number $u(f)$ of…

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…

We show that the following unlinking strategy does not always yield an optimal sequence of crossing changes: first split the link with the minimal number of crossing changes, and then unknot the resulting components.

We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…

In this study of the Reidemeister moves within the classical knot theory, we focus on hard diagrams of knots and links, categorizing them as either rigid or shaky based on their adaptability to certain moves. We establish that every link…

Let $n$ be a positive integer. The aim of this paper is to study two local moves $V(n)$ and $V^{n}$ on welded links, which are generalizations of the crossing virtualization. We show that the $V(n)$-move is an unknotting operation on welded…

A knot (or link) diagram is said to be everywhere equivalent if all the diagrams obtained by switching one crossing represent the same knot (or link). We classify such diagrams of a closed 3-braid.

In this paper, a regional knot invariant is constructed. Like the Wirtinger presentation of a knot group, each planar region contributes a generator, and each crossing contributes a relation. The invariant is call a tridle of the link. As…

We study symmetric crossing change operations for strongly invertible knots. Our main theorem is that the most natural notion of equivariant unknotting number is not additive under connected sum, in contrast with the longstanding conjecture…

In this short note, we investigate the effect of region crossing change on planar trivalent graphs.

Let K be a knot that has an unknotting tunnel tau. We prove that K admits a strong involution that fixes tau pointwise if and only if K is a two-bridge knot and tau its upper or lower tunnel.

We introduce a new numerical invariant of knots and links from the descending diagrams. It is considered to live between the unknotting number and the bridge number.

In this paper we introduce a representation of knots and links called a cube diagram. We show that a property of a cube diagram is a link invariant if and only if the property is invariant under two types of cube diagram operations. A knot…