相关论文: Forbidden detour number on virtual knot

We show that a finite numerical boundary slope of an essential surface in the exterior of a Montesinos knot is bounded above and below in terms of the numbers of positive/negative crossings of a specific minimal diagram of the knot.

In this paper, we define the parity virtual Alexander polynomial following the work of BDGGHN [1] and Kaestner and Kauffman [10]. The properties of this invariant are explored and some examples are computed. In particular, the invariant…

An equilateral stick number $s_{=}(K)$ of a knot $K$ is defined to be the minimal number of sticks required to construct a polygonal knot of $K$ which consists of equal length sticks. Rawdon and Scharein [12] found upper bounds for the…

A $2k$-move is a local deformation adding or removing $2k$ half-twists. We show that if two virtual knots are related by a finite sequence of $2k$-moves, then their $n$-writhes are congruent modulo $k$ for any nonzero integer $n$, and their…

The warping degree of an oriented knot diagram is the minimal number of crossing changes which are required to obtain a monotone knot diagram from the diagram. The minimal warping degree of a knot is the minimal value of the warping degree…

We prove that parities on virtual knots come from invariant 1-cycles on the arcs of knot diagrams. In turn, the invariant cycles are determined by quasi-indices on the crossings of the diagrams. The found connection between the parities and…

In this paper we define and give examples of a family of polynomial invariants of virtual knots and links. They arise by considering certain 2$\times$2 matrices with entries in a possibly non-commutative ring, for example the quaternions.…

We define an invariant of welded virtual knots from each finite crossed module by considering crossed module invariants of ribbon knotted surfaces which are naturally associated with them. We elucidate that the invariants obtained are non…

Consider a robot that remembers only the starting position and walks along a knot once on a knot diagram, switching every undercrossing it meets until it returns to the starting position. We observe that the robot produces an ascending…

A well-known algorithm for unknotting knots involves traversing a knot diagram and changing each crossing that is first encountered from below. The minimal number of crossings changed in this way across all diagrams for a knot is called the…

The stick number of a knot is the minimum number of segments needed to build a polygonal version of the knot. Despite its elementary definition and relevance to physical knots, the stick number is poorly understood: for most knots we only…

New presentations of a link and a virtual link are introduced and algebraic systems on links and virtual links are constructed respectively. Based on the algebraic systems, Reduction Crossing Algorithms for them are proposed which are used…

The unknotting number of knots is a difficult quantity to compute, and even its behavior under basic satelliting operations is not understood. We establish a lower bound on the unknotting number of cable knots and iterated cable knots…

In [8], K. Kaur, S. Kamada et al. posed a problem of finding a virtual knot, if exists, with an unknotting index (n,m), where (n,m) is a pair of non-negative integers. In this paper, we address this question by providing infinite families…

We claim that HOMFLY polynomials for virtual knots, defined with the help of the matrix-model recursion relations, contain more parameters, than just the usual $q$ and $A = q^N$. These parameters preserve topological invariance and do not…

Given a knot K we introduce a new invariant coming from the Blanchfield pairing and we show that it gives a lower bound on the unknotting number of K. This lower bound subsumes the lower bounds given by the Levine-Tristram signatures, by…

A forbidden transition graph is a graph defined together with a set of permitted transitions i.e. unordered pair of adjacent edges that one may use consecutively in a walk in the graph. In this paper, we look for the smallest set of…

We introduce a new numerical knot invariant, termed the \textit{segment number}, which is derived from partitioned knot diagrams subject to specific over/under-crossing constraints. We prove that a knot is non-trivial if and only if its…

The $\Xi$-move is a local move generated by forbidden moves in virtual knot theory. This move was introduced by Taniguchi and the second author, who showed that it characterizes the odd writhe of virtual knots, which is a fundamental…

The first two authors introduced vertex distortion and showed that the vertex distortion of the unknot is trivial. It was conjectured that the vertex distortion of a knot is trivial if and only if the knot is trivial. We will use…