Related papers: Virtual knots and links with unknotting index (n,m…
We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…
A virtual knot, which is one of generalizations of knots in $\mathbb{R}^{3}$ (or $S^{3}$), is, roughly speaking, an embedded circle in thickened surface $S_{g} \times I$. In this talk we will discuss about knots in 3 dimensional $S_{g}…
In this paper we study the chord index of virtual knots, which can be thought of as an extension of the chord parity. We show how to use the chord index to define finite type invariants of virtual knots. The notions of indexed Jones…
Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…
Noting that cycle diagrams of permutations visually resemble grid diagrams used to depict knots and links in topology, we consider the knot (or link) obtained from the cycle diagram of a permutation. We show that the permutations which…
Let $\mathcal {M}$ be the space of all, including singular, long knots in 3-space and for which a fixed projection into the plane is an immersion. Let $cl(\Sigma^{(1)}_{iness})$ be the closure of the union of all singular knots in $\mathcal…
Two natural generalizations of knot theory are the study of spatially embedded graphs, and Kauffman's theory of virtual knots. In this paper we combine these approaches to begin the study of virtual spatial graphs.
This paper employs various computational techniques to determine the bridge numbers of both classical and virtual knots. For classical knots, there is no ambiguity of what the bridge number means. For virtual knots, there are multiple…
We prove that if an alternating knot has unknotting number one, then there exists an unknotting crossing in any alternating diagram. This is done by showing that the obstruction to unknotting number one developed by Greene in his work on…
In the present paper we give a new method for converting virtual knots and links to virtual braids. Indeed the braiding method given in this paper is quite general, and applies to all the categories in which braiding can be accomplished. We…
Knot mosaic theory was introduced by Lomonaco and Kauffman in the paper on `Quantum knots and mosaics' to give a precise and workable definition of quantum knots, intended to represent an actual physical quantum system. A knot (m,n)-mosaic…
It is well-known that a knot in a contact manifold $(M,C)$ transverse to a trivialized contact structure possesses the natural framing given by the first of the trivialization vectors along the knot. If the Euler class $e_C\in H^2(M)$ of…
Introducing a way to modify knots using $n$-trivial rational tangles, we show that knots with given values of Vassiliev invariants of bounded degree can have arbitrary unknotting number (extending a recent result of Ohyama, Taniyama and…
It has been an open question whether the deletion or contraction of an edge in an intrinsically knotted graph always yields an intrinsically linked graph. We present a new intrinsically knotted graph that shows the answer to both questions…
There are three commonly known definitions of the bridge index. These definitions come from combinatorial knot theory, Morse theory, and geometry. In this paper, we prove that the danceability index is a fourth equivalent definition of the…
In this paper, we introduce invariants of virtual knotoids based on biquandles and biquandle virtual brackets. We show that one of these invariants, namely biquandle virtual bracket matrix, is a proper enhancement of the other invariants…
We show that the forbidden detour move, essentially introduced by Kanenobu and Nelson, is an unknotting operation for virtual knots. Then we define the forbidden detour number of a virtual knot to be the minimal number of forbidden detour…
We construct an infinite collection of knots with the property that any knot in this family has $n$-string essential tangle decompositions for arbitrarily high $n$.
We introduce twelve polynomial invariants for long virtual knots, called intersection polynomials, extending and refining the three intersection polynomials for virtual knots. They are defined via intersection numbers of cycles on a closed…
We derive an asymptotic formula for the number of strongly connected digraphs with $n$ vertices and $m$ arcs (directed edges), valid for $m-n\to\infty$ as $n\to \infty$ provided $m=O(n\log n)$. This fills the gap between Wright's results…