相关论文: Invariants of Knot Diagrams

We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison…

We prove that for some knot-like objects one can easily recognize non-equivalence w.r.t. all Reidemeister moves by studying some equivalence classes modulo only 2nd Reidemeister moves. There are applications to virtual knots, graph-links…

For a knot diagram $K$, the classical knot group $\pi_1(K)$ is a free group modulo relations determined by Wirtinger-type relations on the classical crossings. The classical knot group is invariant under the Reidemeister moves. In this…

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…

We give a generating set of the generalized Reidemeister moves for oriented singular links. We use it to introduce an algebraic structure arising from the study of oriented singular knots. We give some examples, including some…

Given any oriented link diagram, two types of new knot invariants are constructed. They satisfy some generalized skein relations. The coefficients of each invariant is from a commutative ring. Homomorphisms and representations of those…

We provide a simple algorithm for recognizing and performing Reidemeister moves in a Gauss diagram.

We develop a reinforcement learning pipeline for simplifying knot diagrams. A trained agent learns move proposals and a value heuristic for navigating Reidemeister moves. The pipeline applies to arbitrary knots and links; we test it on…

This paper deals with the study of a new family of knot invariants: the $L^2$-Alexander invariant. A main result is to give a method of computation of the $L^2$-Alexander invariant of a knot complement using any presentation of default 1 of…

An invariant of knots is constructed from an integral for geometric braids due to Kohno and Kontsevich. It takes values in a quotient by a certain ideal of the algebra generated by chord diagrams over the circle.

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…

Symmetries of knots have been studied extensively, and strongly invertible knots are one of them. Lamm defined the equivariant crossing number $c_t(K)$, the minimum crossing number among all symmetric diagrams for a strongly invertible knot…

A chord diagram is a circle with paired points with each pair of points connected by a chord. Every generic immersed spherical curve provides a chord diagram by associating each chord with two preimages of a double point. Any two spherical…

In this paper we discuss the applications of knotoids to modelling knots in open curves and produce new knotoid invariants. We show how invariants of knotoids generally give rise to well-behaved measures of how much an open curve is…

We introduce and begin the study of new knot energies defined on knot diagrams. Physically, they model the internal energy of thin metallic solid tori squeezed between two parallel planes. Thus the knots considered can perform the second…

The linking number is the simplest link invariant given by Gauss; it is the first Gauss diagram formula expressed by one arrow among two circles. Proceeding the next stage, we study the second Gauss diagram formula consisting of two arrows…

Vassiliev invariants can be studied by studying the spaces of chord diagrams associated with singular knots. To these chord diagrams are associated the intersection graphs of the chords. We extend results of Chmutov, Duzhin and Lando to…

Any knot diagram can be transformed into the unknot by a series of unknotting operations. This paper introduces the diagonal move, a novel unknotting operation that generalizes and unifies several existing moves. We prove that the diagonal…

We introduce some chain maps between Khovanov complexes. Each of the chain maps commutes with a chain homotopy map and a retraction maps which obtain a Reidemeister invariance of Khovanov homology.

In previous papers, the author realized the following principle for many knot theories: if a knot diagram is complicated enough then it reproduces itself, i.e., is a subdiagram of any other diagram equivalent to it. This principle is…