In this article we discuss applications of neural networks to recognising knots and, in particular, to the unknotting problem. One of motivations for this study is to understand how neural networks work on the example of a problem for which rigorous mathematical algorithms for its solution are known. We represent knots by rectangular Dynnikov diagrams and apply neural networks to distinguish a given diagram class from the given finite families of topological types. The data presented to the program is generated by applying Dynnikov moves to initial samples. The significance of using these diagrams and moves is that in this context the problem of determining whether a diagram is unknotted is a finite search of a bounded combinatorial space.
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.
A correspondence is studied by H. Matsuda between front projections of Legendrian links in the standard contact structure for 3-space and rectangular diagrams. In this paper, we introduce braided rectangular diagrams, and study a relationship with Legendrian links in the standard contact structure for 3-space. We show Alexander and Markov Theorems for Legendrian links in 3-space.
If a rectangular diagram represents the trivial knot, then it can be deformed into the trivial rectangular diagram with only four edges by a finite sequence of merge operations and exchange operations, without increasing the number of edges, which was shown by I. A. Dynnikov. Using this, Henrich and Kauffman gave an upper bound for the number of Reidemeister moves needed for unknotting a knot diagram of the trivial knot. However, exchange or merge moves on the top and bottom pairs of edges of rectangular diagrams are not considered in the proof. In this paper, we show that there is a rectangul…
In an earlier paper we introduced rectangular diagrams of surfaces and showed that any isotopy class of a surface in the three-sphere can be presented by a rectangular diagram. Here we study transformations of those diagrams and introduce moves that allow transition between diagrams representing isotopic surfaces. We also introduce more general combinatorial objects called mirror diagrams and various moves for them that can be used to transform presentations of isotopic surfaces to each other. The moves can be divided into two types so that, vaguely speaking, type~I moves commute with type~II …
Inspired by the paper on quantum knots and knot mosaics [23] and grid diagrams (or arc presentations), used extensively in the computations of Heegaard-Floer knot homology [2,3,7,24], we construct the more concise representation of knot mosaics and grid diagrams via mirror-curves. Tame knot theory is equivalent to knot mosaics [23], mirror-curves, and grid diagrams [3,7,22,24]. Hence, we introduce codes for mirror-curves treated as knot or link diagrams placed in rectangular square grids, suitable for software implementation. We provide tables of minimal mirror-curve codes for knots and links …
As a new step in the study of rectangularly-colored knot polynomials, we reformulate the prescription of arXiv:1606.06015 for twist knots in the double-column representations $R=[rr]$ in terms of skew Schur polynomials. These, however, are mysteriously shifted from the standard topological locus, what makes further generalization to arbitrary $R=[r^s]$ not quite straightforward.
In this paper Legendrian graphs in $(\mathbb{R}^3,ξ_{\mathrm{st}})$ are considered modulo Legendrian isotopy and edge contraction. To a Legendrian graph we associate a (generalized) rectangular diagram --- a purely combinatorial object. Moves of rectangular diagrams are introduced so that equivalence classes of Legendrian graphs and rectangular diagrams coincide. Using this result we prove that the classes of Legendrian graphs are in one-to-one correspondence with fence diagrams modulo fence moves introduced by Rudolph.
Differential expansion (DE) for a Wilson loop average in representation $R$ is built to respect degenerations of representations for small groups. At the same time it behaves nicely under some changes of the loop, e.g. of some knots in the case of $3d$ Chern-Simons theory. Especially simple is the relation between the DE for the trefoil $3_1$ and for the figure eight knot $4_1$. Since arbitrary colored HOMFLY for the trefoil are known from the Rosso-Jones formula, it is therefore enough to find their DE in order to make a conjecture for the figure eight. We fulfil this program for all rectangu…
In earlier papers we introduced a representation of isotopy classes of compact surfaces embedded in the three-sphere by so called rectangular diagrams. The formalism proved useful for comparing Legendrian knots. The aim of this paper is to prove a Reidemeister type theorem for rectangular diagrams of surfaces.
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.
We introduce a new very large family of transformations of rectangular diagrams of links that preserve the isotopy class of the link. We provide an example when two diagrams of the same complexity are related by such a transformation and are not obtained from one another by any sequence of `simpler' moves not increasing the complexity of the diagram along the way.
We introduce a simple combinatorial way, which we call a rectangular diagram of a surface, to represent a surface in the three-sphere. It has a particularly nice relation to the standard contact structure on $\mathbb S^3$ and to rectangular diagrams of links. By using rectangular diagrams of surfaces we are going, in particular, to develop a method to distinguish Legendrian knots. This requires a lot of technical work of which the present paper addresses only the first basic question: which isotopy classes of surfaces can be represented by a rectangular diagram. Vaguely speaking the answer is …
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.
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.
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, …
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.
In the present paper a criteria for a rectangular diagram to admit a simplification is given in terms of Legendrian knots. It is shown that there are two types of simplifications which are mutually independent in a sense. A new proof of the monotonic simplification theorem for the unknot is given. It is shown that a minimal rectangular diagram maximizes the Thurston--Bennequin number for the corresponding Legendrian links. Jones' conjecture about the invariance of the algebraic number of intersections of a minimal braid representing a fixed link type is proved.
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.
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.
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.
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.
We introduce the warping polynomial of an oriented knot diagram. In this paper, we characterize the warping polynomial, and define the span of a knot to be the minimal span of the warping polynomial for all diagrams of the knot. We show that the span of a knot is one if and only if it is non-trivial and alternating, and we give an inequality between the span and the dealternating number.
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.
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…
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.
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.
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.
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.
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.
We rewrite the recently proposed differential expansion formula for HOMFLY polynomials of the knot $4_1$ in arbitrary rectangular representation $R=[r^s]$ as a sum over all Young sub-diagrams $λ$ of $R$ with extraordinary simple coefficients $D_{λ^{tr}}(r)\cdot D_λ(s)$ in front of the $Z$-factors. Somewhat miraculously, these coefficients are made from quantum dimensions of symmetric representations of the groups $SL(r)$ and $SL(s)$ and restrict summation to diagrams with no more than $s$ rows and $r$ columns. They possess a natural $β$-deformation to Macdonald dimensions and produces positive…
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.
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 for all oriented minimal diagrams of the knot. In this paper, all prime alternating knots with minimal warping degree two are determined.
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…
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…
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
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.
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.
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.
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.
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 …
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…
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.
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.$
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}$) .
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.
