arXiv research

Paper detects checkerboard colorability of virtual links using odd writhe and arrow polynomial.

New polynomial for checkerboard-colorable 4-valent virtual graphs.

The paper confirms a conjecture and extends arrow polynomial to twisted links.

The notion of chckerboard colorability for virtual links and abstract links is introduced. We study the Jones polynomials of virtual links and abstruct links. It is proved that a certain property of the Jones polynomials of classical links is valid for virtual links which admit checkerboard colorings.

Determinant modulo 8 classifies virtual knots based on polynomial coefficients.

Extends Gordon-Litherland pairing to links in thickened surfaces, defining new invariants.

New invariant for virtual links defined using homology.

New spanning tree model connects knot homology, s-invariant, and exotic discs.

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.

A group-theoretical method, via Wada's representations, is presented to distinguish Kishino's virtual knot from the unknot. Biquandles are constructed for any group using Wada's braid group representations. Cocycle invariants for these biquandles are studied. These invariants are applied to show the non-existence of Al…

Parallelization technique for welded links preserves equivalence and yields specific decompositions.

We introduce a topological combinatorial game called the Link Smoothing Game. The game is played on the shadow of a link diagram and legal moves consist of smoothing precrossings. One player's goal is to keep the diagram connected while the other player's goal is to disconnect the shadow. We make significant progress t…

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 …

The Jones polynomial can be expressed in terms of spanning trees of the graph obtained by checkerboard coloring a knot diagram. We show there exists a complex generated by these spanning trees whose homology is the reduced Khovanov homology. The spanning trees provide a filtration on the reduced Khovanov complex and a …

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 th…

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 d…

We give constructions to realize an odd number, which is representable as sum of two squares, as determinant of an achiral knot, thus proving that these are exactly the numbers occurring as such determinants. Later we study which numbers occur as determinants of prime alternating achiral knots, and obtain a complete re…

Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram $L$, there is an associated ribbon graph whose quasi-trees correspond bijectively to …

Let F be a closed surface and i:F \to S^3 a generic immersions. Then S^3 - i(F) is a union of connected regions, which may be separated into two sets {U_j} and {V_j} by a checkerboard coloring. For k \geq 0, let a_k, b_k be the number of components U_j, V_j with χ(U_j) = 1-k, χ(V_j)=1-k, respectively. Two more integers…

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 virt…