Please login to be able to save your searches and receive alerts for new content matching your search criteria.
A local move is a pair of tangles with same end points. Habiro defined a system of local moves, Cn-moves, and showed that two knots have the same Vassiliev invariants of order ≤ n - 1 if and only if they are transformed into each other by Cn-moves. We define a local move, βn-move, which is obtained from a Cn-move by duplicating a single pair of arcs with same end points. Then we immediately have that a Cn+1-move is realized by a βn-move and that a βn-move is realized by twice Cn-moves. In this note we study the relation between Cn-move and βn-move, and in particular, give answers to the following questions: (1) Is a βn-move realized by a finite sequence of Cn+1-moves? (2) Is Cn-move realized by a finite sequence of βn-moves?
We define a local move called a CF-move on virtual link diagrams, and show that any virtual knot can be deformed into a trivial knot by using generalized Reidemeister moves and CF-moves. Moreover, we define a new virtual link invariant n(L) for a virtual 2-component link L whose virtual linking number is an integer. Then we give necessary and sufficient conditions for two virtual 2-component links to be deformed into each other by using generalized Reidemeister moves and CF-moves in terms of a virtual linking number and n(L).
Gusarov and Habiro introduced a Cm move, that is strongly related to Vassiliev invariants. In this note, we study a special kind of Cm move, called a non-self Cm move. We show that two links can be transformed into each other by a finite sequence of non-self Cm moves if and only if (1) the two links can be transformed into each other by a finite sequence of Cm moves, and (2) the knot types of corresponding components coincide.
We show that any nontrivial reduced knot projection can be obtained from a trefoil projection by a finite sequence of half-twisted splice operations and their inverses such that the result of each step in the sequence is reduced.
Goussarov, Polyak and Viro defined a finite type invariant and a local move called an n-variation for virtual knots. In this paper, we give the differences of the values of the finite type invariants of degree 2 and 3 between two virtual knots which can be transformed into each other by a 2- and 3-variation, respectively. As a result, we obtain lower bounds of the distance between long virtual knots by 2-variations and the distance between virtual knots by 3-variations by using the values of the finite type invariants of degree 2 and 3, respectively.
We introduce a local move on a link diagram named a region freeze crossing change which is close to a region crossing change, but not the same. We study similarity and difference between region crossing change and region freeze crossing change.
We consider a local move, denoted by λ, on knot diagrams or virtual knot diagrams.If two (virtual) knots K1 and K2 are transformed into each other by a finite sequence of λ moves, the λ distance between K1 and K2 is the minimum number of times of λ moves needed to transform K1 into K2. By Γλ(K), we denote the set of all (virtual) knots which can be transformed into a (virtual) knot K by λ moves. A geodesic graph for Γλ(K) is the graph which satisfies the following: The vertex set consists of (virtual) knots in Γλ(K) and for any two vertices K1 and K2, the distance on the graph from K1 to K2 coincides with the λ distance between K1 and K2. When we consider virtual knots and a crossing change as a local move λ, we show that the N-dimensional lattice graph for any given natural number N and any tree are geodesic graphs for Γλ(K).
We study the effects of certain local moves on Homflyptand Kauffman polynomials. We show that all Homflypt(or Kauffman) polynomials are equal in a certain nontrivial quotient of the Laurent polynomial ring. As a consequence, we discover some new properties of these invariants.
We extend a notion, an unknotting operation for knots, to a spatial embedding of a graph and study local moves on a diagram of a spatial graph.
The simplest potential counterexample to Y. Nakanishi's, 20 year old, conjecture that the 4-move is an unknotting operation is unknotted using 4-moves (Problem 1.59, 3a in the Kirby Problem List) thus showing it to not be one.