A zero polynomial of virtual knots

2016 ◽  
Vol 25 (01) ◽  
pp. 1550078 ◽  
Author(s):  
Myeong-Ju Jeong
Keyword(s):  
Similar Type ◽  
Virtual Knot ◽  
Virtual Knots ◽  
Vassiliev Invariant

In 2013, Cheng and Gao introduced the writhe polynomial of virtual knots and Kauffman introduced the affine index polynomial of virtual knots. We introduce a zero polynomial of virtual knots of a similar type by considering weights of a suitable collection of crossings of a virtual knot diagram. We show that the zero polynomial gives a Vassiliev invariant of degree 1. It distinguishes a pair of virtual knots that cannot be distinguished by the affine index polynomial and the writhe polynomial.

scholarly journals An Orientation-Sensitive Vassiliev Invariant for Virtual Knots

2003 ◽  
Vol 12 (06) ◽  
pp. 767-779 ◽  
Author(s):  
Jörg Sawollek
Keyword(s):  
Virtual Link ◽  
Zeroth Order ◽  
Opposite Orientation ◽  
Vassiliev Invariants ◽  
Virtual Knot ◽  
First Order ◽  
Virtual Knots ◽  
Conway Polynomial ◽  
Vassiliev Invariant ◽  
Open Question

It is an open question whether there are Vassiliev invariants that can distinguish an oriented knot from its inverse, i.e., the knot with the opposite orientation. In this article, an example is given for a first order Vassiliev invariant that takes different values on a virtual knot and its inverse. The Vassiliev invariant is derived from the Conway polynomial for virtual knots. Furthermore, it is shown that the zeroth order Vassiliev invariant coming from the Conway polynomial cannot distinguish a virtual link from its inverse and that it vanishes for virtual knots.

Delta moves and Kauffman polynomials of virtual knots

2014 ◽  
Vol 23 (10) ◽  
pp. 1450053 ◽  
Author(s):  
Myeong-Ju Jeong
Keyword(s):  
Lower Bound ◽  
Virtual Knot ◽  
Virtual Knots ◽  
Vassiliev Invariant ◽  
Kauffman Polynomial

In 1990, Okada showed that the second coefficients of the Conway polynomials of two knots differ by 1 if the two knots are related by a single Δ-move. We extend the Okada's result for virtual knots by using a Vassiliev invariant v2 of virtual knots of degree 2 which is induced from the Kauffman polynomial of a virtual knot. We show that v2(K1) - v2(K2) = ±48, if K2 is a virtual knot obtained from a virtual knot K1 by applying a Δ-move. From this we have a lower bound [Formula: see text] for the number of Δ-moves if two virtual knots K1 and K2 are related by a sequence of Δ-moves.

THE PARITY WRITHE POLYNOMIALS FOR VIRTUAL KNOTS AND FLAT VIRTUAL KNOTS

2013 ◽  
Vol 22 (01) ◽  
pp. 1250133 ◽  
Author(s):  
YOUNG HO IM ◽  
SERA KIM ◽  
DONG SOO LEE
Keyword(s):  
Polynomial Invariant ◽  
Virtual Knot ◽  
Virtual Knots ◽  
Vassiliev Invariant

We introduce a polynomial invariant with two variables for an oriented virtual knot, which refines the odd writhe polynomial with one variable due to Cheng by using a modified version of the warping degree. Our invariant is a Vassiliev invariant of degree one, reduces to one variable for a checkerboard colorable virtual knot, vanishes for classical knots, and detects non-invertibility and non-amphicheirality for some cases. We raise some examples to show effectiveness of our invariant. Moreover we define a similar invariant for a flat virtual knot.

Finiteness of the set of virtual knots with a given state number

2018 ◽  
Vol 27 (08) ◽  
pp. 1850049
Author(s):  
Takuji Nakamura ◽  
Yasutaka Nakanishi ◽  
Shin Satoh
Keyword(s):  
The Real ◽  
Virtual Knot ◽  
Virtual Knots ◽  
Minimum Number ◽  
Number Formula

A state of a virtual knot diagram [Formula: see text] is a collection of circles obtained from [Formula: see text] by splicing all the real crossings. For each integer [Formula: see text], we denote by [Formula: see text] the number of states of [Formula: see text] with [Formula: see text] circles. The [Formula: see text]-state number [Formula: see text] of a virtual knot [Formula: see text] is the minimum number of [Formula: see text] for [Formula: see text] of [Formula: see text]. Let [Formula: see text] be the set of virtual knots [Formula: see text] with [Formula: see text] for an integer [Formula: see text]. In this paper, we study the finiteness of [Formula: see text]. We determine the finiteness of [Formula: see text] for any [Formula: see text] and [Formula: see text] for any [Formula: see text].

scholarly journals A LINKING NUMBER DEFINITION OF THE AFFINE INDEX POLYNOMIAL AND APPLICATIONS

2013 ◽  
Vol 22 (12) ◽  
pp. 1341004 ◽  
Author(s):  
LENA C. FOLWACZNY ◽  
LOUIS H. KAUFFMAN
Keyword(s):  
Virtual Knots ◽  
Linking Number ◽  
Linking Numbers ◽  
Vassiliev Invariant ◽  
Definition Of

This paper gives an alternate definition of the Affine Index Polynomial (called the Wriggle Polynomial) using virtual linking numbers and explores applications of this polynomial. In particular, it proves the Cosmetic Crossing Change Conjecture for odd virtual knots and pure virtual knots. It also demonstrates that the polynomial can detect mutations by positive rotation and proves it cannot detect mutations by positive reflection. Finally it exhibits a pair of mutant knots that can be distinguished by a type 2 vassiliev invariant coming from the polynomial.

Picture-valued parity-biquandle bracket

2020 ◽  
Vol 29 (02) ◽  
pp. 2040004 ◽  
Author(s):  
Denis P. Ilyutko ◽  
Vassily O. Manturov
Keyword(s):  
Classical Case ◽  
Linear Combinations ◽  
Virtual Knot ◽  
Virtual Knots ◽  
Underlying Graph ◽  
Kauffman Bracket ◽  
Knot Diagrams

In V. O. Manturov, On free knots, preprint (2009), arXiv:math.GT/0901.2214], the second named author constructed the bracket invariant [Formula: see text] of virtual knots valued in pictures (linear combinations of virtual knot diagrams with some crossing information omitted), such that for many diagrams [Formula: see text], the following formula holds: [Formula: see text], where [Formula: see text] is the underlying graph of the diagram, i.e. the value of the invariant on a diagram equals the diagram itself with some crossing information omitted. This phenomenon allows one to reduce many questions about virtual knots to questions about their diagrams. In [S. Nelson, M. E. Orrison and V. Rivera, Quantum enhancements and biquandle brackets, preprint (2015), arXiv:math.GT/1508.06573], the authors discovered the following phenomenon: having a biquandle coloring of a certain knot, one can enhance various state-sum invariants (say, Kauffman bracket) by using various coefficients depending on colors. Taking into account that the parity can be treated in terms of biquandles, we bring together the two ideas from these papers and construct the picture-valued parity-biquandle bracket for classical and virtual knots. This is an invariant of virtual knots valued in pictures. Both the parity bracket and Nelson–Orrison–Rivera invariants are partial cases of this invariant, hence this invariant enjoys many properties of various kinds. Recently, the authors together with E. Horvat and S. Kim have found that the picture-valued phenomenon works in the classical case.

A LOWER BOUND FOR THE NUMBER OF FORBIDDEN MOVES TO UNKNOT A LONG VIRTUAL KNOT

2013 ◽  
Vol 22 (06) ◽  
pp. 1350024 ◽  
Author(s):  
MYEONG-JU JEONG
Keyword(s):  
Lower Bound ◽  
Finite Type ◽  
Finite Sequence ◽  
Virtual Knot ◽  
Virtual Knots ◽  
Finite Type Invariants ◽  
Combinatorial Representations ◽  
Congruent Modulo

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

scholarly journals UNKNOTTING VIRTUAL KNOTS WITH GAUSS DIAGRAM FORBIDDEN MOVES

2001 ◽  
Vol 10 (06) ◽  
pp. 931-935 ◽  
Author(s):  
SAM NELSON
Keyword(s):  
Virtual Knot ◽  
Virtual Knots ◽  
Reidemeister Moves ◽  
Gauss Diagram

The forbidden moves can be combined with Gauss diagram Reidemeister moves to obtain move sequences with which we may change any Gauss diagram (and hence any virtual knot) into any other, including in particular the unknotted diagram.

INVARIANTS OF FLAT VIRTUAL LINKS INDUCED FROM VASSILIEV INVARIANTS OF DEGREE ONE FOR VIRTUAL LINKS

2011 ◽  
Vol 20 (12) ◽  
pp. 1649-1667 ◽  
Author(s):  
YOUNG HO IM ◽  
SERA KIM ◽  
KYEONGHUI LEE
Keyword(s):  
Vassiliev Invariants ◽  
Virtual Knot ◽  
Virtual Knots ◽  
Virtual Links

We introduce invariants of flat virtual links which are induced from Vassiliev invariants of degree one for virtual links. Also we give several properties of these invariants for flat virtual links and examples. In particular, if the value of some invariants of flat virtual knots F are non-zero, then F is non-invertible so that every virtual knot overlying F is non-invertible.

scholarly journals PARITY AND EXOTIC COMBINATORIAL FORMULAE FOR FINITE-TYPE INVARIANTS OF VIRTUAL KNOTS

2012 ◽  
Vol 21 (13) ◽  
pp. 1240001 ◽  
Author(s):  
MICAH WHITNEY CHRISMAN ◽  
VASSILY OLEGOVICH MANTUROV
Keyword(s):  
Finite Type ◽  
Combinatorial Formula ◽  
Knot Invariants ◽  
Virtual Knot ◽  
Additional Information ◽  
Virtual Knots ◽  
Finite Type Invariants ◽  
Gauss Diagram

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.

Sign in / Sign up

Export Citation Format

Share Document