Related papers: On Virtual Crossing Numbers for Virtual Knots

There has been significant research dedicated towards computing the crossing numbers of families of graphs resulting from the Cartesian products of small graphs with arbitrarily large paths, cycles and stars. For graphs with four or fewer…

This paper investigates the parity concept in knotoids in $S^2$ and in $\mathbb{R}^2$ in relation with virtual knots. We show that the virtual closure map is not surjective and give specific examples of virtual knots that are not in the…

We investigate an application of crossing parity for the bracket expansion of the Jones polynomial for virtual knots. In addition we consider an application of parity for the arrow polynomial as well as for the categorifications of both…

It is known that each knot has a semimeander diagram (i. e. a diagram composed of two smooth simple arcs), however the number of crossings in such a diagram can only be roughly estimated. In the present paper we provide a new estimate of…

In this paper we discuss how to define a chord index via smoothing a real crossing point of a virtual knot diagram. Several polynomial invariants of virtual knots and links can be recovered from this general construction. We also explain…

Pseudodiagrams are knot or link diagrams where some of the crossing information is missing. Pseudoknots are equivalence classes of pseudodiagrams, where equivalence is generated by a natural set of Reidemeister moves. In this paper, we…

In this paper we give the results of a computer search for biracks of small size and we give various interpretations of these findings. The list includes biquandles, racks and quandles together with new invariants of welded knots and…

We use the rational Witt class of a knot in the 3-sphere as a tool for addressing questions about its unknotting number. We apply these tools to several low crossing knots (151 knots with 11 crossing and 100 knots with 12 crossings) and to…

For any link in the 3-sphere, there is a natural lower bound for the unlinking number in terms of the classical signature. We prove that if this lower bound is sharp for a special alternating link $L$, then the unlinking number of $L$ is…

Geometric interpretations of some virtual knot invariants are given in terms of invariants of links in $\mathbb{S}^3$. Alexander polynomials of almost classical knots are shown to be specializations of the multi-variable Alexander…

A conjecture proposed by J. Tripp in 2002 states that the crossing number of any knot coincides with the canonical genus of its Whitehead double. In the meantime, it has been established that this conjecture is true for a large class of…

This paper is a concise introduction to virtual knot theory, coupled with a list of research problems in this field.

The composition of any two nontrivial classical knots is a satellite knot, and thus, by work of Thurston, is not hyperbolic. In this paper, we explore the composition of virtual knots, which are an extension of classical knots that…

Computing the crossing number of a graph is one of the most classical problems in computational geometry. Both it and numerous variations of the problem have been studied, and overcoming their frequent computational difficulty is an active…

The crossing number is the smallest number of pairwise edge-crossings when drawing a graph into the plane. There are only very few graph classes for which the exact crossing number is known or for which there at least exist constant…

In 2002, D. Hrencecin and L.H. 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…

This paper, to be regularly updated, lists those prime knots with the fewest possible number of crossings for which values of basic knot invariants, such as the unknotting number or the smooth 4-genus, are unknown. This list is being…

We probe the character of knotting in open, confined polymers, assigning knot types to open curves by identifying their projections as virtual knots. In this sense, virtual knots are transitional, lying in between classical knot types,…

The ropelength of a knot is the minimum length required to tie it. Computational upper bounds have previously been computed for every prime knot with up to 11 crossings. Here, we present ropelength measurements for the 2176 knots with 12…

We present a practical algorithm to determine the minimal genus of non-orientable spanning surfaces for 2-bridge knots, called the crosscap numbers. We will exhibit a table of crosscap numbers of 2-bridge knots up to 12crossings (all 362 of…