相关论文: Minimal diagrams of classical and virtual links
For a link with zero determinants, a Z-coloring is defined as a generalization of Fox coloring. We call a link having a diagram which admits a non-trivial Z-coloring a Z-colorable link. The minimal coloring number of a Z-colorable link is…
We present an easy example of mutant links with different Khovanov homology. The existence of such an example is important because it shows that Khovanov homology cannot be defined with a skein rule similar to the skein relation for the…
In this paper we study the relation between two diagrammatic representations of links in lens spaces: the disk diagram and the grid diagram and we find how to pass from one to the other. We also investigate whether the HOMFLY-PT invariant…
The purpose of this paper is to construct and study equivariant Khovanov homology - a version of Khovanov homology theory for periodic links. Since our construction works regardless of the characteristic of the coefficient ring it…
The minimal coloring number of a $\mathbb{Z}$-colorable link is the minimal number of colors for non-trivial $\mathbb{Z}$-colorings on diagrams of the link. In this paper, we show that the minimal coloring number of any non-splittable…
In this paper, we show that a link which has a positive and almost alternating diagram is alternating, besides that a positive and non-alternating Montesinos link has an almost positive-alternating diagram.
We consider knot theories possessing a {\em parity}: each crossing is decreed {\em odd} or {\em even} according to some universal rule. If this rule satisfies some simple axioms concerning the behaviour under Reidemeister moves, this leads…
We define a second Steenrod square for virtual links, which is stronger than Khovanov homology for virtual links, toward constructing Khovanov-Lipshitz-Sarkar stable homotopy type for virtual links. This induces the first meaningful…
In this paper, we give definitions of three kinds of minimal charts, and we investigate properties of minimal charts and establish fundamental theorems characterizing minimal charts. To classify charts with two or three crossings we use the…
We find the minimal number of links in an embedding of any complete $k$-partite graph on 7 vertices (including $K_7$, which has at least 21 links). We give either exact values or upper and lower bounds for the minimal number of links for…
Maps from links in thickened surfaces to flat-virtual links help to construct invariants of links using invariants of flat-virtual links. This work is dedicated to investigation of equivalence and invariants of flat-virtual diagrams…
We extend the cobordism based categorification of the virtual Jones polynomial to virtual tangles. This extension is combinatorial and has semi-local properties. We use the semi-local property to prove an applications, i.e. we give a…
In this paper, we give a necessary condition for a diagram to represent the trivial knot.
We prove a conjecture by Van Dam and Sotirov on the smallest eigenvalue of (distance-$j$) Hamming graphs and a conjecture by Karloff on the smallest eigenvalue of (distance-$j$) Johnson graphs. More generally, we study the smallest…
For classical knots, there is a concept of (semi)meander diagrams; in this short note we generalize this concept to virtual knots and prove that the classes of meander and semimeander diagrams are universal (this was known for classical…
A link is almost alternating if it is non-alternating and has a diagram that can be transformed into an alternating diagram via one crossing change. We give formulas for the first two and last two potential coefficients of the Jones…
Virtual braids are a combinatorial generalization of braids. We present abstract braids as equivalence classes of braid diagrams on a surface, joining two distinguished boundary components. They are identified up to isotopy, compatibility,…
In this paper, we discuss the Hamiltonicity of graphs in terms of Wiener index, hyper-Wiener index and Harary index of their quasi-complement or complement. Firstly, we give some sufficient conditions for an balanced bipartite graph with…
Two link diagrams on compact surfaces are strongly equivalent if they are related by Reidemeister moves and orientation preserving homeomorphisms of the surfaces. They are stably equivalent if they are related by the two previous operations…
In this paper, we discuss filamentations on oriented chord diagrams. When a filamentation cannot be realized on an oriented chord diagram, then the corresponding flat virtual knot is non-trivial. If a flat knot diagram is non-trivial, then…