The warping matrix of a knot diagram

The warping degree of a knot diagram

For an oriented knot diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain the monotone diagram from D in the usual way. We show that d(D) + d(-D) + 1 is less than or equal to the crossing number of D. Moreover the equality holds if and only if D is an alternating diagram.

Quantization of the crossing number of a knot diagram

We introduce the warping crossing polynomial of an oriented knot diagram by using the warping degrees of crossing points of the diagram. Given a closed transversely intersected plane curve, we consider oriented knot diagrams obtained from the plane curve as states to take the sum of the warping crossing polynomials for all the states for the plane curve. As an application, we show that every closed transversely intersected plane curve with even crossing points has two independent canonical orientations and every based closed transversely intersected plane curve with odd crossing points has two…

关于编织结的解结数与区域解结数的一个注记

A note on the unknotting number and the region unknotting number of weaving knots

本文定义了辫图的翘曲度，通过对编织结图的翘曲度进行图解与组合检查，给出了某些编织结族的解结数和区域解结数的上界。

The warping degree of a link diagram

For an oriented link diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain a monotone diagram from D. We show that d(D)+d(-D)+sr(D) is less than or equal to the crossing number of D, where -D denotes the inverse of D and sr(D) denotes the number of components which have at least one self-crossing. Moreover, we give a necessary and sufficient condition for the equality. We also consider the minimal d(D)+d(-D)+sr(D) for all diagrams D. For the warping degree and linking warping degree, we show some relations to the linking number, unknotting num…

Lattice Diagrams of Knots and Diagrams of Lattice Stick Knots

We give a simple example showing that a knot or link diagram that lies in the ${\mathbb{Z}}^2$ lattice is not necessarily the projection of a lattice stick knot or link in the ${\mathbb{Z}}^3$ lattice, and we give a necessary and sufficient condition for when a knot or link diagram that lies in the ${\mathbb{Z}}^2$ lattice is in fact the projection of a lattice stick knot or link.

Invariants of Knot Diagrams

We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal number of Reidemeister moves needed to pass between certain pairs of knot diagrams.

The almost alternating diagrams of the trivial knot

Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram representing the trivial knot. As a corollary we determine an unknotting number one alternating knot with a property that the unknotting operation can be done on its alternating diagram.

A property of diagrams of the trivial knot

In this paper, we give a necessary condition for a diagram to represent the trivial knot.

Invariants of knot diagrams and relations among Reidemeister moves

In this paper a classification of Reidemeister moves, which is the most refined, is introduced. In particular, this classification distinguishes some $Ω_3$-moves that only differ in how the three strands that are involved in the move are ordered on the knot. To transform knot diagrams of isotopic knots into each other one must in general use $Ω_3$-moves of at least two different classes. To show this, knot diagram invariants that jump only under $Ω_3$-moves are introduced. Knot diagrams of isotopic knots can be connected by a sequence of Reidemeister moves of only six, out of the total of 24, …

Small examples of cube diagrams of knots

In this short note we highlight some of the differences between cube diagrams and grid diagrams. We also list examples of small cube diagrams for all knots up to 7 crossings and give some examples of links.

11-colored knot diagram with five colors

We prove that any $11$-colorable knot is presented by an $11$-colored diagram where exactly five colors of eleven are assigned to the arcs. The number five is the minimum for all non-trivially $11$-colored diagrams of the knot. We also prove a similar result for any $11$-colorable ribbon $2$-knot.

Minimal diagrams of classical knots

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 and knots.

On rack colorings for surface-knot diagrams without branch points

Racks do not give us invariants of surface-knots in general. For example, if a surface-knot diagram has branch points (and a rack which we use satisfies some mild condition), then it admits no rack colorings. In this paper, we investigate rack colorings for surface-knot diagrams without branch points and prove that rack colorings are invariants of $S^2$-knots. We also prove that rack colorings for $S^2$-knots can be interpreted in terms of quandles, and discuss a relationship with regular-equivalences of surface-knot diagrams.

Gauss diagrams of real and virtual knots in the solid torus

We define a new kind of Gauss diagrams to describe knots in the solid torus with projections in the annulus. We see that it provides an efficient tool for showing that a knot diagram can be fully recovered from its decorated Gauss diagram, and we use it to establish a characterization of the decorated Gauss diagrams of closed braids.

Diagrammatic unknotting of knots and links in the projective space

In the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the notion of descending diagram for knots and links in the real space is extended to the case of nonoriented knots and links in the projective space. It is also shown that this notion cannot be extended to oriented links.

Unique diagram of a spatial arc and the knotting probability

It is shown that the projection image of an oriented spatial arc to any oriented plane is approximated by a unique arc diagram (up to isomorphic arc diagrams) determined from the spatial arc and the projection. In a separated paper, the knotting probability of an arc diagram is defined as an invariant under isomorphic arc diagrams. By combining them, the knotting probability of every oriented spatial arc is defined.

Encoding knots by clasp diagrams

We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather than out of crossings. We describe an equivalence relation on clasp diagrams which produces the isotopy classes of knots as equivalence classes. This equivalence relation is generated by local moves similar to the Reidemeister moves. Clasp diagrams produce particularly simple Seifert surfaces for knots and lead to an explicit formula for the Alexander-Conway p…

所有10交叉以下强可逆纽结的对称图

Symmetric diagrams for all strongly invertible knots up to 10 crossings

该研究提供10交叉以下强可逆纽结的对称图表格，指出其横截图与对称并图的相似性并讨论相关开放问题，为强可逆纽结研究提供基础参考。

The incompatibility of crossing number and bridge number for knot diagrams

We define and compare several natural ways to compute the bridge number of a knot diagram. We study bridge numbers of crossing number minimizing diagrams, as well as the behavior of diagrammatic bridge numbers under the connected sum operation. For each notion of diagrammatic bridge number considered, we find crossing number minimizing knot diagrams which fail to minimize bridge number. Furthermore, we construct a family of minimal crossing diagrams for which the difference between diagrammatic bridge number and the actual bridge number of the knot grows to infinity.

On the tree-width of knot diagrams

We show that a small tree-decomposition of a knot diagram induces a small sphere-decomposition of the corresponding knot. This, in turn, implies that the knot admits a small essential planar meridional surface or a small bridge sphere. We use this to give the first examples of knots where any diagram has high tree-width. This answers a question of Burton and of Makowsky and Mariño.

Sutured Heegaard diagrams for knots

We define sutured Heegaard diagrams for null-homologous knots in 3-manifolds. These diagrams are useful for computing the knot Floer homology at the top filtration level. As an application, we give a formula for the knot Floer homology of a Murasugi sum. Our result echoes Gabai's earlier works. We also show that for so-called 'semifibred' satellite knots, the top filtration term of the knot Floer homology is isomorphic to the counterpart of the companion.

A move on diagrams that generates S-equivalence of knots

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 polynomial if and only if it can be undone by doubled-delta moves.

Stable Equivalence of Knots on Surfaces and Virtual Knot Cobordisms

We introduce an equivalence relation, called stable equivalence, on knot diagrams and closed curves on surfaces. We give bijections between the set of abstract knots, the set of virtual knots, and the set of the stable equivalence classes of knot diagrams on surfaces. Using these bijections, we define concordance and link homology for virtual links. As an application, it is shown that Kauffman's example of a virtual knot diagram is not equivalent to a classical knot diagram.

随机纽结图中的纽结概率

Knot Probabilities in Random Diagrams

该研究提出随机纽结图模型，通过统计10交叉点及以下的纽结图分类计算精确概率，发现平凡纽结占比高（10交叉点图约78%且源于树状图特性，且纽结概率对数与排名对数近似符合Zipf定律。

On two types of Heegaard diagram used in knot Floer homology

In this brief note, we give an explicit sequence of Heegaard moves interpolating between local versions of the Kauffman-states Heegaard diagram and the planar Heegaard diagram used in knot Floer homology, and show how these local moves can be used to go between the global versions of the Heegaard diagrams.

On the bridge number of knot diagrams with minimal crossings

Given a diagram $D$ of a knot $K$, we consider the number $c(D)$ of crossings and the number $b(D)$ of overpasses of $D$. We show that, if $D$ is a diagram of a nontrivial knot $K$ whose number $c(D)$ of crossings is minimal, then $1+\sqrt{1+c(D)} \leq b(D)\leq c(D)$. These inequalities are shape in the sense that the upper bound of $b(D)$ is achieved by alternating knots and the lower bound of $b(D)$ is achieved by torus knots. The second inequality becomes an equality only when the knot is an alternating knot. We prove that the first inequality becomes an equality only when the knot is a tor…

Unknotting rectangular diagrams of the trivial knot by exchanging moves

If a rectangular diagram represents the trivial knot, then it can be deformed into the rectangular diagram with only two vertical edges by a finite sequence of merge operations and exchange operations, without increasing the number of vertical edges, which was shown by I. A. Dynnikov. We show in this paper that we need no merge operations to deform a rectangular diagram of the trivial knot to one with no crossings.

Diagram uniqueness for highly twisted knots

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. Instead, we consider diagrams enumerated by bridge number, following the lead of Schubert who classified 2-bridge knots in the 1950s. We prove a uniqueness result for this enumeration. Using recent developments in geometric topology, including distances in the curve complex and techniques with incompressible surfaces, we show that infinitely many knot and link…

虚拟纽结与链环的虚拟多重交叉与花瓣图

Virtual Multicrossings and Petal Diagrams for Virtual Knots and Links

本文将经典纽结的多重交叉概念推广至虚拟纽结与链环，并证明所有虚拟纽结均存在花瓣图。

Unknotting virtual knots with Gauss diagram forbidden moves

The forbidden moves can be combined with Gauss diagram Reidemeister moves to obtain move sequences with which we may change any Gauss diagram (and hence any virtual knot) into any other, including in particular the unknotted diagram

强正双向纽结的双对称图枚举

The enumeration of doubly symmetric diagrams for strongly positive amphicheiral knots

作为双对称图与强正双向纽结系列研究的第二部分，本文提出素纽结双对称图的枚举策略，确定了18交叉以内的所有相关情形，还补充了Gauss词起源及Gauss标记不可实现词的方法。

A Reidemeister type theorem for petal diagrams of knots

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 exchanges, which do not change the isotopy class of the underlying knot. We prove that any two permutations which represent isotopic knots can be related by a sequence of these moves and their inverses.

虚拟纽结的曲径图

Meander diagrams of virtual knots

本文将经典纽结的（半）曲径图概念推广到虚拟纽结，证明其曲径图类的通用性，并引入虚拟k-弧交叉数这一新不变量，通过Manturov投影证明经典纽结的虚拟与经典k-弧交叉数相等。

Combinatorial Random Knots

We explore free knot diagrams, which are projections of knots into the plane which don't record over/under data at crossings. We consider the combinatorial question of which free knot diagrams give which knots and with what probability. Every free knot diagram is proven to produce trefoil knots, and certain simple families of free knots are completely worked out. We make some conjectures (supported by computer-generated data) about bounds on the probability of a knot arising from a fixed free diagram being the unknot, or being the trefoil.

Regular-equivalence of $2$-knot diagrams and sphere eversions

For each diagram $D$ of a $2$-knot, we provide a way to construct a new diagram $D'$ of the same knot such that any sequence of Roseman moves between $D$ and $D'$ necessarily involves branch points. The proof is done by developing the observation that no sphere eversion can be lifted to an isotopy in $4$-space.

On diagrammatic bounds of knot volumes and spectral invariants

In recent years, several families of hyperbolic knots have been shown to have both volume and $λ_1$ (first eigenvalue of the Laplacian) bounded in terms of the twist number of a diagram, while other families of knots have volume bounded by a generalized twist number. We show that for general knots, neither the twist number nor the generalized twist number of a diagram can provide two-sided bounds on either the volume or $λ_1$. We do so by studying the geometry of a family of hyperbolic knots that we call double coil knots, and finding two-sided bounds in terms of the knot diagrams on both the …

A spinning construction for virtual 1-knots and 2-knots, and the fiberwise and welded equivalence of virtual 1-knots

We succeed to generalize spun knots of classical 1-knots to the virtual 1-knot case by using the `spinning construction'. That, is, we prove the following: Let $Q$ be a spun knot of a virtual 1-knot $K$ by our method. The embedding type $Q$ in $S^4$ depends only on $K$. Furthermore we prove the following: The submanifolds, $Q$ and the embedded torus made from $K,$ defined by Satoh's method, in $S^4$ are isotopic. We succeed to generalize the above construction to the virtual 2-knot case. Note that Satoh's method says nothing about the virtual 2-knot case. Rourke's interpretation of Satoh's met…

Knotoids

We introduce and study knotoids. Knotoids are represented by diagrams in a surface which differ from the usual knot diagrams in that the underlying curve is a segment rather than a circle. Knotoid diagrams are considered up to Reidemeister moves applied away from the endpoints of the underlying segment. We show that knotoids in $S^2$ generalize knots in $S^3$ and study the semigroup of knotoids. We also discuss applications to knots and invariants of knotoids.

具有双重对称图的强正 amphicheiral 纽结

Strongly positive amphicheiral knots with doubly symmetric diagrams

本文分类至多16个交叉的素强正 amphicheiral 纽结，刻画其双重对称或近乎双重对称图，并发现14a19470为表中首个非slice实例。

交叉数为13且弧指标为13的素结的最小网格图

Minimal grid diagrams of the prime knots with crossing number 13 and arc index 13

本文列出了交叉数13且弧指标13的非交错素结的最小网格图，利用Knotscape的DT码生成生成树，获得最小弧表示。

Chebyshev diagrams for rational knots

We show that every rational knot $K$ of crossing number $N$ admits a polynomial parametrization $x=T_a(t), y = T_b(t), z = C(t)$ where $T_k(t)$ are the Chebyshev polynomials, $a=3$ and $b+ °C = 3N.$ We show that every rational knot also admits a polynomial parametrization with $a=4$. If $C (t)= T_c(t)$ is a Chebyshev polynomial, we call such a knot a harmonic knot. We give the classification of harmonic knots for $a \le 4.$

Unknotting twisted knots with Gauss diagram forbidden moves

Twisted knot theory, introduced by M.O.Bourgoin, is a generalization of virtual knot theory. It is easily shown that any virtual knot can be deformed into a trivial knot by a finite sequence of generalized Reidemeister moves and two "forbidden moves" $F_{1}$ and $F_{2}$. Similarly, we show that any twisted knot also can be deformed into a trivial knot or a trivial knot with a bar by a finite sequence of extended Reidemeister moves and three "forbidden moves" $T_{4}$, $F_{1}$ (or $F_{2}$) and $F_{3}$ (or $F_{4}$) .

A Representation Theorem for Knots and a Generalization of the Fundamental Theorem of Finite Type Invariants

We provide a way to produce knots in $S^3$ from signed chord diagrams, and prove that every knot can be produced in this way. Using these diagrams, we generalize the fundamental theorem of finite type invariants. We also provide moves for the diagrams so that any two diagrams for the same knot are connected by a sequence of moves.

New classes of minimal knot diagrams

We describe a new class of minimal link diagrams. This class includes certain alternating diagrams, the standard diagrams of all torus links, and numerous homogeneous diagrams whose minimality has not been proven before. Besides, we describe a new larger class of link diagrams with the least number of Seifert circles among all diagrams of a given link. Our approach refers to the Morton-Franks-Williams inequality.

Minimal Grid Diagrams of the Prime Alternating Knots with 12 Crossings

In this article, we give a list of minimal grid diagrams of the 12 crossing prime alternating knots. This is a continuation of the work in https://doi.org/10.1142/S0218216520500765

Knot diagrams on a punctured sphere as a model of string figures

A string figure is topologically a trivial knot lying on an imaginary plane orthogonal to the fingers with some crossings. The fingers prevent cancellation of these crossings. As a mathematical model of string figure we consider a knot diagram on the $xy$-plane in $xyz$-space missing some straight lines parallel to the $z$-axis. These straight lines correspond to fingers. We study minimal number of crossings of these knot diagrams under Reidemeister moves missing these lines.

Virtual Knot Diagrams and the Witten-Reshetikhin-Turaev Invariant

The Witten-Reshetikhin-Turaev invariant of classical link diagrams is generalized to virtual link diagrams. This invariant is unchanged by the framed Reidemeister moves and the Kirby calculus. As a result, it is also an invariant of the 3-manifolds represented by the classical link diagrams. This generalization is used to demonstrate that there are virtual knot diagrams with a non-trivial Witten-Reshetikhin-Turaev invariant and trivial 3-manifold fundamental group.

On L-space knots obtained from unknotting arcs in alternating diagrams

Let $D$ be a diagram of an alternating knot with unknotting number one. The branched double cover of $S^3$ branched over $D$ is an L-space obtained by half integral surgery on a knot $K_D$. We denote the set of all such knots $K_D$ by $\mathcal D$. We characterize when $K_D\in \mathcal D$ is a torus knot, a satellite knot or a hyperbolic knot. In a different direction, we show that for a given $n>0$, there are only finitely many L-space knots in $\mathcal D$ with genus less than $n$.

浸入式扁平带状纽结

Immersed flat ribbon knots

该研究通过将浸入式平面带状纽结链环空间嵌入圆盘图空间求解最小带长，给出反例与猜想，计算了部分小型及无限族链环图的最小带长，还得到了对应最小带长的图的交叉数界。

从纽结到2-链环、弦图的映射以及增强瓦西里耶夫不变量的一种方法

Maps from knots to $2$-links, chord diagrams, and a way to enhance Vassiliev invariants

研究如何将瓦西里耶夫纽结不变量等推广到特定带框弦图，核心方法是探讨相关映射，主要贡献是提供推广方式。

$S_{g} \times S^{1}$中的结、其本质图与虚拟结

Knots in $S_{g} \times S^{1}$, their essential diagrams and virtual knots

本文研究了$S_{g} \times S^{1}$中结的本质图，并证明了虚拟结理论与该理论的嵌套关系，同时探讨了通过2-组件链环构造$S^{2} \times S^{1}$中结的方法及其极小性和分离性。

A New Way to Tabulate Knots

We introduce a new way to tabulate knots by representing knot diagrams using a pair of planar trees. This pair of trees have their edges labeled by integers, they have no valence 2 vertices, and they have the same number of valence 1 vertices. The number of valence 1 vertices of the trees is called the girth of the knot diagram. The classification problem of knots admitting girth 2 and 3 diagrams is studied. The planar tree pair representations of girth less than 4 for knot diagrams in Rolfsen's table are given.

具有13个交叉的素交错纽结的极小网格图

Minimal grid diagrams of the prime alternating knots with 13 crossings

本文针对4878个具有13个交叉的素交错纽结，构造并给出含15个竖直线段的极小网格图，从而确定其极小弧表示。

The minimal sequence of Reidemister moves bringing the diagram of $(n+1,n)$-torus knot to that of $(n,n+1)$-torus knot

Let $D(p,q)$ be the usual knot diagram of the $(p,q)$-torus knot, that is, $D(p,q)$ is the closure of the $p$-braid $(σ_1^{-1} σ_2^{-1}... σ_{p-1}^{-1})^q$. As is well-known, $D(p,q)$ and $D(q,p)$ represent the same knot. It is shown that $D(n+1,n)$ can be deformed to $D(n,n+1)$ by a sequence of $\{(n-1)n(2n-1)/6 \} + 1$ Reidemeister moves, which consists of a single RI move and $(n-1)n(2n-1)/6$ RIII moves. Using cowrithe, we show that this sequence is minimal over all sequences which bring $D(n+1,n)$ to $D(n,n+1)$.