scholarly journals Finite-type invariants of classical and virtual knots

Topology ◽  
2000 ◽  
Vol 39 (5) ◽  
pp. 1045-1068 ◽  
Author(s):  
Mikhail Goussarov ◽  
Michael Polyak ◽  
Oleg Viro
2013 ◽  
Vol 22 (06) ◽  
pp. 1350024 ◽  
Author(s):  
MYEONG-JU JEONG

Nelson and Kanenobu showed that forbidden moves unknot any virtual knot. Similarly a long virtual knot can be unknotted by a finite sequence of forbidden moves. Goussarov, Polyak and Viro introduced finite type invariants of virtual knots and long virtual knots and gave combinatorial representations of finite type invariants. We introduce Fn-moves which generalize the forbidden moves. Assume that two long virtual knots K and K′ are related by a finite sequence of Fn-moves. We show that the values of the finite type invariants of degree 2 of K and K′ are congruent modulo n and give a lower bound for the number of Fn-moves needed to transform K to K′.


2013 ◽  
Vol 22 (08) ◽  
pp. 1350042 ◽  
Author(s):  
MIGIWA SAKURAI

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.


2012 ◽  
Vol 21 (13) ◽  
pp. 1240001 ◽  
Author(s):  
MICAH WHITNEY CHRISMAN ◽  
VASSILY OLEGOVICH MANTUROV

The present paper produces examples of Gauss diagram formulae for virtual knot invariants which have no analogue in the classical knot case. These combinatorial formulae contain additional information about how a subdiagram is embedded in a virtual knot diagram. The additional information comes from the second author's recently discovered notion of parity. For a parity of flat virtual knots, the new combinatorial formulae are Kauffman finite-type invariants. However, many of the combinatorial formulae possess exotic properties. It is shown that there exists an integer-valued virtualization invariant combinatorial formula of order n for every n (i.e. it is stable under the map which changes the direction of one arrow but preserves the sign). Hence, it is not of Goussarov–Polyak–Viro finite-type. Moreover, every homogeneous Polyak–Viro combinatorial formula admits a decomposition into an "even" part and an "odd" part. For the Gaussian parity, neither part of the formula is of GPV finite-type when it is non-constant on the set of classical knots. In addition, eleven new non-trivial combinatorial formulae of order 2 are presented which are not of GPV finite-type.


2019 ◽  
Vol 28 (10) ◽  
pp. 1950064 ◽  
Author(s):  
Nicolas Petit

We generalize three invariants, first discovered by Henrich, to the long and/or framed virtual knot case. These invariants are all finite-type invariants of order one, and include a universal invariant. The generalization will require us to extend the notion of a based matrix of a virtual string, first introduced by Turaev and later generalized by Henrich, to the long and framed cases.


2011 ◽  
Vol 20 (3) ◽  
pp. 282-287 ◽  
Author(s):  
Dror Bar-Natan ◽  
Iva Halacheva ◽  
Louis Leung ◽  
Fionntan Roukema

2014 ◽  
Vol 54 (4) ◽  
pp. 639-653 ◽  
Author(s):  
Myeong-Ju Jeong ◽  
Chan-Young Park ◽  
Soon Tae Yeo

2010 ◽  
Vol 19 (05) ◽  
pp. 655-675 ◽  
Author(s):  
MICAH W. CHRISMAN

In this paper, we investigate twist sequences for Kauffman finite-type invariants and Goussarov–Polyak–Viro finite-type invariants. It is shown that one obtains a Kauffman or GPV type of degree ≤ n if and only if an invariant is a polynomial of degree ≤ n on every twist lattice of the right form. The main result of this paper is an application of this technique to the coefficients of the Jones–Kauffman polynomial. It is shown that the Kauffman finite-type invariants obtained from these coefficients are not GPV finite-type invariants of any degree by explicitly showing they can never be polynomials. This generalizes a result of Kauffman [8], where it is known for degree k = 2.


Sign in / Sign up

Export Citation Format

Share Document