Related papers: Vertex distortion detects the unknot

We show that for any nontrivial knot $K$ and any natural number $n$ there is a diagram $D$ of $K$ such that the unknotting number of $D$ is greater than or equal to $n$. It is well known that twice the unknotting number of $K$ is less than…

The paper introduces Slope Conjecture which relates the degree of the Jones polynomial of a knot and its parallels with the slopes of incompressible surfaces in the knot complement. More precisely, we introduce two knot invariants, the…

The 1-2-3 Conjecture, posed in 2004 by Karonski, Luczak, and Thomason, is as follows: "If G is a graph with no connected component having exactly 2 vertices, then the edges of G may be assigned weights from the set {1,2,3} so that, for any…

It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be…

Site percolation in a distorted simple cubic lattice is characterized numerically employing the Newman-Ziff algorithm. Distortion is administered in the lattice by systematically and randomly dislocating its sites from their regular…

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…

This manuscript introduces a new framework for the study of knots by exploring the neighborhood of knot embeddings in the space of simple open and closed curves in 3-space. The latter gives rise to a knotoid spectrum, which determines the…

In this paper we present a sequence of link invariants, defined from twisted Alexander polynomials, and discuss their effectiveness in distinguish knots. In particular, we recast and extend by geometric means a recent result of Silver and…

In a recent work of I.\,Dynnikov and M.\,Prasolov a new method of comparing Legendrian knots is proposed. In general, to apply the method requires a lot of technical work. In particular, one needs to search all rectangular diagrams of…

In this paper, the Kelvin wave and knot dynamics are studied on three dimensional smoothly deformed entangled vortex-membranes in five dimensional space. Owing to the existence of local Lorentz invariance and diffeomorphism invariance, in…

A conjecture of Shumakovitch states that every nontrivial knot has 2-torsion in its Khovanov homology. We show that if a knot $K$ has no 2-torsion in its Khovanov homology, then the rank of its reduced Khovanov homology is minimal among all…

This note gives the first example of a hyperbolic knot in the 3-sphere that lacks a nonorientable essential spanning surface; this disproves the Strong Neuwirth Conjecture formulated by Ozawa and Rubinstein. Moreover, this knot has no even…

Let $G$ be a finite, simple, and undirected graph of order $n$ and average degree $d$. Up to terms of smaller order, we characterize the minimal intervals $I$ containing $d$ that are guaranteed to contain some vertex degree. In particular,…

Geometric torsions are torsions of acyclic complexes of vector spaces which consist of differentials of geometric quantities assigned to the elements of a manifold triangulation. We use geometric torsions to construct invariants for a…

Vidussi was the first to construct knotted Lagrangian tori in simply connected four dimensional manifolds. Fintushel and Stern introduced a second way to detect such knotting.This note demonstrates that similar examples may be distinguished…

We consider surface links in the 4-space which are presented by the form of simple branched coverings over the standard torus, which we call torus-covering links. In this paper, we study unknotting numbers of torus-covering links. In some…

We show that the forbidden detour move, essentially introduced by Kanenobu and Nelson, is an unknotting operation for virtual knots. Then we define the forbidden detour number of a virtual knot to be the minimal number of forbidden detour…

The skewness of a graph G is the minimum number of edges in G whose removal results in a planar graph. By appropriately introducing a weight to each edge of a graph, we determine, among other thing, the skewness of the generalized Petersen…

It is proved that the Wedderburn Theorem on finite division rings implies that all knots and links in the smooth 4-dimensional manifolds are trivial.

We provide upper bounds on the perturbation of invariant subspaces of normal matrices measured using a metric on the space of vector subspaces of $\mathbb{C}^n$ in terms of the spectrum of both the unperturbed \& perturbed matrices, as well…