Related papers: A new unknotting operation for classical and welde…
We enumerate and show tables of minimal diagrams for all prime knots up to the triple-crossing number equal to five. We derive a minimal generating set of oriented moves connecting triple-crossing diagrams of the same oriented knot. We also…
Mosaic diagrams for knots were first introduced in 2008 by Lomanoco and Kauffman for the purpose of building a quantum knot system. Since then, many others have explored the structure of these knot mosaic diagrams, as they are interesting…
A (weak chord) index is a function on the crossings of knot diagrams such that: 1) the index of a crossing does not change under Reidemeister moves; 2) crossings which can be paired by a second Reidemeister move have the same index. We show…
The motivation for this work was to construct a nontrivial knot with trivial Jones polynomial. Although that open problem has not yielded, the methods are useful for other problems in the theory of knot polynomials. The subject of the…
The topological underpinnings are presented for a new algorithm which answers the question: `Is a given knot the unknot?' The algorithm uses the braid foliation technology of Bennequin and of Birman and Menasco. The approach is to consider…
Kuperberg [Algebr. Geom. Topol. 3 (2003) 587-591] has shown that a virtual knot corresponds (up to generalized Reidemeister moves) to a unique embedding in a thichened surface of minimal genus. If a virtual knot diagram is equivalent to a…
Knots are entangled structures that cannot be untangled without a cut. Topological stability of knots is one of the many examples of their important properties that can be used in information storage and transfer. Knot dynamics is important…
We study petal diagrams of knots, which provide a method of describing knots in terms of permutations in a symmetric group $S_{2n+1}$. We define two classes of moves on such permutations, called trivial petal additions and crossing…
We introduce the multiplexing of a crossing, replacing a classical crossing of a virtual link diagram with multiple crossings which is a mixture of classical and virtual. For integers $m_{i}$ $(i=1,\ldots,n)$ and an ordered $n$-component…
We introduce an up-down coloring of a virtual-link diagram. The colorabilities give a lower bound of the minimum number of Reidemeister moves of type II which are needed between two 2-component virtual-link diagrams. By using the notion of…
We show that if a classical knot diagram satisfies a certain combinatorial condition then it is minimal with respect to the number of classical crossings. This statement is proved by using the Kauffman bracket and the construction of atoms…
It is a natural question to ask whether two links are equivalent by the following moves -- parallel parts of a link are changed to k-times half-twisted parts and if they are, how many moves are needed to go from one link to the other. In…
Two knots in three-space are S-equivalent if they are indistinguishable by Seifert matrices. We show that S-equivalence is generated by the doubled-delta move on knot diagrams. It follows as a corollary that a knot has trivial Alexander…
We present a method for the explicit diagonalization of some Hankel operators. This method allows us to recover classical results on the diagonalization of Hankel operators with the absolutely continuous spectrum. It leads also to new…
We prove that a crossing change along a double point circle on a 2-knot is realized by ribbon-moves for a knotted torus obtained from the 2-knot by attaching a 1-handle. It follows that any 2-knots for which the crossing change is an…
The notion of a welded link was introduced by Fenn, Rim\'anyi, and Rourke as an analogue of welded braids. A welded link is defined as an equivalence class of link diagrams that may contain virtual crossings, where the equivalence is…
We address here the topological equivalence of knots through the so-called Reidemeister moves. These topology-conserving manipulations are recast into dynamical rules on the crossings of knot diagrams. This is presented in terms of a simple…
This paper is an introduction to the subject of virtual knot theory, combined with a discussion of some specific new theorems about virtual knots. The new results are as follows: We prove, using a 3-dimensional topology approach that if a…
The slicing number of a knot, $u_s(K)$, is the minimum number of crossing changes required to convert $K$ to a slice knot. This invariant is bounded above by the unknotting number and below by the slice genus $g_s(K)$. We show that for many…
We introduce a way to color the regions of a classical knot diagram using ternary operations, so that the number of colorings is a knot invariant. By choosing appropriate substitutions in the algebras that we assign to diagrams, one obtains…