On arrow polynomials of checkerboard colorable virtual links

Converting virtual link diagrams to normal ones

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering technique. We show that the normal virtual link diagrams obtained from two equivalent virtual link diagrams are related by generalized Reidemeister moves and Kauffman flypes.

Coherent double coverings of virtual link diagrams

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram. We show that the normal virtual link diagrams obtained by this method from two equivalent virtual link diagrams are equivalent. We discuss the relationship between this method and some invariants of virtual links.

The Khovanov homology of alternating virtual links

In this paper, we study the Khovanov homology of an alternating virtual link $L$ and show that it is supported on $g+2$ diagonal lines, where $g$ equals the virtual genus of $L$. Specifically, we show that $Kh^{i,j}(L)$ is supported on the lines $j=2i-σ_ξ+2k-1$ for $0\leq k\leq g+1$ where $σ_{ξ^*}(L)+2g= σ_ξ(L)$ are the signatures of $L$ for a checkerboard coloring $ξ$ and its dual $ξ^*$. Of course, for classical links, the two signatures are equal and this recovers Lee's $H$-thinness result for $Kh^{*,*}(L)$. Our result applies more generally to give an upper bound for the homological width o…

The Kauffman bracket of virtual links and the Bollobás-Riordan polynomial

We show that the Kauffman bracket $[L]$ of a checkerboard colorable virtual link $L$ is an evaluation of the Bollobás-Riordan polynomial $R_{G_L}$ of a ribbon graph associated with $L$. This result generalizes Thistlethwaite's celebrated theorem relating the Kauffman bracket with the Tutte polynomial of planar graphs.

虚拟链环的Jones-Kauffman多项式的交错性

On Alternateness of the Jones-Kauffman Polynomial of Virtual Links

本文研究虚拟链环的Jones-Kauffman多项式的交错性，定义拟交错虚拟链环类，利用扭转技术构造无限族，并给出棋盘可着色链环的拟行列式的连通状态展开。

Graphical virtual links and a polynomial of signed cyclic graphs

For a signed cyclic graph G, we can construct a unique virtual link L by taking the medial construction and convert 4-valent vertices of the medial graph to crossings according to the signs. If a virtual link can occur in this way then we say that the virtual link is graphical. In the article we shall prove that a virtual link L is graphical if and only if it is checkerboard colorable. On the other hand, we introduce a polynomial F[G] for signed cyclic graphs, which is defined via a deletion-marking recursion. We shall establish the relationship between F[G] of a signed cyclic graph G and the …

汤普森群 $V$ 与虚拟纽结理论

Thompson's Group $V$ and Virtual Link Theory

该研究将琼斯关于汤普森群的纽结表示方案推广到汤普森群 $V$，定义了其到加厚曲面CC虚拟纽结的满射，构造了定向子群 $\vec{V}$ 及其酉表示，实现了所有定向几乎经典虚拟纽结。