scholarly journals Kauffman–Harary conjecture for alternating virtual knots

2015 ◽  
Vol 24 (08) ◽  
pp. 1550046
Author(s):  
Zhiyun Cheng
Keyword(s):  
Affirmative Answer ◽  
Virtual Knot ◽  
Virtual Knots ◽  
Prime Determinant ◽  
Knot Diagrams

In 1999, Kauffman–Harary conjectured that every non-trivial Fox p-coloring of a reduced, alternating knot diagram with prime determinant p is heterogeneous. Ten years later this conjecture was proved by Mattman and Solis. Williamson generalized this conjecture to alternating virtual knots and proved it for certain families of alternating virtual knots. In this paper, by studying the coloring matrices and the determinants of alternating virtual knot diagrams we give an affirmative answer to the Kauffman–Harary conjecture for alternating virtual knots.

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.

Geodesic graphs for a homotopy class of virtual knots

2017 ◽  
Vol 26 (13) ◽  
pp. 1750090
Author(s):  
Sumiko Horiuchi ◽  
Yoshiyuki Ohyama
Keyword(s):  
Homotopy Class ◽  
Finite Sequence ◽  
Dimensional Lattice ◽  
Virtual Knot ◽  
Virtual Knots ◽  
Minimum Number ◽  
Vertex Set ◽  
Number Formula ◽  
Lattice Graph ◽  
Knot Diagrams

We consider a local move, denoted by [Formula: see text], on knot diagrams or virtual knot diagrams.If two (virtual) knots [Formula: see text] and [Formula: see text] are transformed into each other by a finite sequence of [Formula: see text] moves, the [Formula: see text] distance between [Formula: see text] and [Formula: see text] is the minimum number of times of [Formula: see text] moves needed to transform [Formula: see text] into [Formula: see text]. By [Formula: see text], we denote the set of all (virtual) knots which can be transformed into a (virtual) knot [Formula: see text] by [Formula: see text] moves. A geodesic graph for [Formula: see text] is the graph which satisfies the following: The vertex set consists of (virtual) knots in [Formula: see text] and for any two vertices [Formula: see text] and [Formula: see text], the distance on the graph from [Formula: see text] to [Formula: see text] coincides with the [Formula: see text] distance between [Formula: see text] and [Formula: see text]. When we consider virtual knots and a crossing change as a local move [Formula: see text], we show that the [Formula: see text]-dimensional lattice graph for any given natural number [Formula: see text] and any tree are geodesic graphs for [Formula: see text].

A PARITY AND A MULTI-VARIABLE POLYNOMIAL INVARIANT FOR VIRTUAL LINKS

2013 ◽  
Vol 22 (13) ◽  
pp. 1350073 ◽  
Author(s):  
YOUNG HO IM ◽  
KYOUNG IL PARK
Keyword(s):  
Knot Theory ◽  
Virtual Link ◽  
Polynomial Invariant ◽  
Polynomial Invariants ◽  
Virtual Knot ◽  
Virtual Knots ◽  
Link Diagrams ◽  
Virtual Links ◽  
Knot Diagrams

We introduce a parity of classical crossings of virtual link diagrams which extends the Gaussian parity of virtual knot diagrams and the odd writhe of virtual links that extends that of virtual knots introduced by Kauffman [A self-linking invariants of virtual knots, Fund. Math.184 (2004) 135–158]. Also, we introduce a multi-variable polynomial invariant for virtual links by using the parity of classical crossings, which refines the index polynomial introduced in [Index polynomial invariants of virtual links, J. Knot Theory Ramifications19(5) (2010) 709–725]. As consequences, we give some properties of our invariant, and raise some examples.

scholarly journals FILAMENTATIONS FOR VIRTUAL LINKS

2006 ◽  
Vol 15 (03) ◽  
pp. 327-338 ◽  
Author(s):  
WILLIAM J. SCHELLHORN
Keyword(s):  
Virtual Knot ◽  
Virtual Knots ◽  
Chord Diagrams ◽  
Virtual Links ◽  
Knot Diagrams

In 2002, Hrencecin and Kauffman defined a filamentation invariant on oriented chord diagrams that may determine whether the corresponding flat virtual knot diagrams are non-trivial. A virtual knot diagram is non-classical if its related flat virtual knot diagram is non-trivial. Hence filamentations can be used to detect non-classical virtual knots. We extend these filamentation techniques to virtual links with more than one component. We also give examples of virtual links that they can detect as non-classical.

Classification of genus 1 virtual knots having at most five classical crossings

2014 ◽  
Vol 23 (06) ◽  
pp. 1450031 ◽  
Author(s):  
Akimova Alena Andreevna ◽  
Sergei Vladimirovich Matveev
Keyword(s):  
Virtual Knot ◽  
Virtual Knots ◽  
Kauffman Polynomial ◽  
Thickened Torus ◽  
Knot Diagrams ◽  
Genus One

The goal of this paper is to tabulate all genus one prime virtual knots having diagrams with ≤ 5 classical crossings. First, we construct all nonlocal prime knots in the thickened torus T × I which have diagrams with ≤ 5 crossings and admit no destabilizations. Then we use a generalized version of the Kauffman polynomial to prove that all those knots are different. Finally, we convert the knot diagrams in T thus obtained into virtual knot diagrams in the plane.

Characterization of signed Gauss paragraphs and skew-symmetric graded matrices

2018 ◽  
Vol 27 (01) ◽  
pp. 1850002 ◽  
Author(s):  
José Gregorio Rodríguez-Nieto
Keyword(s):  
Embedded Graphs ◽  
Intersection Pairing ◽  
Virtual Knot ◽  
Virtual Knots ◽  
Virtual Links ◽  
The One ◽  
Minimal Realizations ◽  
Knot Diagrams ◽  
Bracket Polynomials

In this paper, we use theory of embedded graphs on oriented and compact [Formula: see text]-surfaces to construct minimal realizations of signed Gauss paragraphs. We prove that the genus of the ambient surface of these minimal realizations can be seen as a function of the maximum number of Carter’s circles. For the case of signed Gauss words, we use a generating set of [Formula: see text], given in [G. Cairns and D. Elton, The Planarity problem for signed Gauss world, J. Knots Theor. Ramif. 2(4) (1993) 359–367], and the intersection pairing of immersed [Formula: see text]-normal curves to present a short solution of the signed Gauss word problem. We relate this solution with the one given by Cairns and Elton. Moreover, we define the join operation on signed Gauss paragraphs to produce signed Gauss words such that both can be realized on the same minimal genus [Formula: see text]-surface. We connect the characterization of signed Gauss paragraph with the recognition virtual links problem. Also we present a combinatorial algorithm to compute, in an easier way, skew-symmetric graded matrices [V. Turaev, Cobordism of knots on surfaces, J. Topol. 1(2) (2008) 285–305] for virtual knots through the concept of triplets [M. Toro and J. Rodríguez, Triplets associated to virtual knot diagrams, Rev. Integración (2011)]. Therefore, we can prove that the Kishino’s knot is not classical, moreover, we prove that the virtual knots of the family [Formula: see text] given in [H. A. Dye, Virtual knots undetected by [Formula: see text] and [Formula: see text]-strand bracket polynomials, Topol. Appl. 153 (2005) 141–160] are not classical knots.

STABLE EQUIVALENCE OF KNOTS ON SURFACES AND VIRTUAL KNOT COBORDISMS

2002 ◽  
Vol 11 (03) ◽  
pp. 311-322 ◽  
Author(s):  
J. SCOTT CARTER ◽  
SEIICHI KAMADA ◽  
MASAHICO SAITO
Keyword(s):  
Equivalence Relation ◽  
Equivalence Classes ◽  
Virtual Knot ◽  
Virtual Knots ◽  
Link Homology ◽  
Stable Equivalence ◽  
Virtual Links ◽  
Curves On Surfaces ◽  
Immersed Curves ◽  
Knot Diagrams

We introduce an equivalence relation, called stable equivalence, on knot diagrams and closed generically immersed curves on surfaces. We give bijections between the set of abstract knots, the set of virtual knots, and the set of the stable equivalence classes of knot diagrams on surfaces. Using these bijections, we define concordance and link homology for virtual links. As an application, it is shown that Kauffman's example of a virtual knot diagram is not equivalent to a classical knot diagram.

scholarly journals ON VIRTUAL CROSSING NUMBER ESTIMATES FOR VIRTUAL LINKS

2009 ◽  
Vol 18 (06) ◽  
pp. 757-772 ◽  
Author(s):  
DENIS MIKHAILOVICH AFANASIEV ◽  
VASSILY OLEGOVICH MANTUROV
Keyword(s):  
Infinite Series ◽  
Crossing Number ◽  
Virtual Knot ◽  
Virtual Knots ◽  
Crossing Numbers ◽  
Virtual Links ◽  
Knot Diagrams ◽  
Extremal Properties

Considering extremal properties of one polynomial of virtual knots, we establish estimates for virtual crossing numbers of virtual knots from a given class. This yields minimality of certain diagrams of virtual knots with respect to the virtual crossing number. Infinite series of pairwise distinct minimal virtual knot diagrams are constructed and their properties are discussed.

An invariant of virtual knots using flat virtual knot diagrams

2018 ◽  
Vol 27 (04) ◽  
pp. 1850024 ◽  
Author(s):  
Joonoh Kim ◽  
Mihaw Shin
Keyword(s):  
Virtual Knot ◽  
Virtual Knots ◽  
Integer Labeling ◽  
Knot Diagrams

In this paper, we describe a method of making an invariant of virtual knots that is defined in terms of an integer labeling of the flat virtual knot diagram. We give an invariant of flat virtual knots using the invariant above. Moreover, we derive a relation of two invariants.

scholarly journals Virtual Mosaic Knot Theory

2020 ◽  
pp. 2050091
Author(s):  
Sandy Ganzell ◽  
Allison Henrich
Keyword(s):  
Knot Theory ◽  
Computational Results ◽  
Tile Type ◽  
Virtual Knot ◽  
Virtual Knots ◽  
Link Type ◽  
Knot Diagrams

Mosaic diagrams for knots were first introduced in 2008 by Lomanoco and Kauffman for the purpose of building a quantum knot system. Since then, many others have explored the structure of these knot mosaic diagrams, as they are interesting objects of study in their own right. Knot mosaics have been generalized by Garduño to virtual knots, by including an additional tile type to represent virtual crossings. There is another interpretation of virtual knots, however, as knot diagrams on surfaces, which inspires this work. By viewing classical mosaic diagrams as [Formula: see text]-gons and gluing edges of these polygons, we obtain knots on surfaces that can be viewed as virtual knots. These virtual mosaics are our present objects of study. In this paper, we provide a set of moves that can be performed on virtual mosaics that preserve knot and link type, we show that any virtual knot or link can be represented as a virtual mosaic, and we provide several computational results related to virtual mosaic numbers for small classical and virtual knots.

Sign in / Sign up

Export Citation Format

Share Document