Related papers: Vertex distortion detects the unknot

We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that…

We take a close look at a classical magic trick performed with a string, where a trivial knot is seemingly isotoped into a trefoil, and generalize it to a family of magic tricks for transforming the unknot into other knots. We encode such a…

This is an introductory article on high dimensional knots for the beginners. High dimensional knot theory is an exciting field. It is a field of knot theory, which is one of topology and is connected with many ones. In this article we use…

There are two motivation questions in \cite{MTS, MTS1} about Castelnuovo-Mumford regularity and vertex decomposable of simple graph $G$. In this paper, we disprove the questions by providing of two counterexamples.

A theorem of Kronheimer and Mrowka states that Khovanov homology is able to detect the unknot. That is, if a knot has the Khovanov homology of the unknot, then it is equivalent to it. Similar results hold for the trefoils and the…

We consider knot theories possessing a {\em parity}: each crossing is decreed {\em odd} or {\em even} according to some universal rule. If this rule satisfies some simple axioms concerning the behaviour under Reidemeister moves, this leads…

We present a method which provides a unified framework for most stability theorems that have been proved in graph and hypergraph theory. Our main result reduces stability for a large class of hypergraph problems to the simpler question of…

A digraph $D$ is an oriented graph if $D$ does not have a pair of opposite arcs. The degree of a vertex $v$ of $D$ is the sum of the in-degree and out-degree of $v.$ Let $fvs(D)$ be the minimum number of vertices whose deletion from $D$…

We generalize to $n$-torsion a result of Kempf's describing $2$-torsion points lying on a theta divisor. This is accomplished by means of certain semihomogeneous vector bundles introduced and studied by Mukai and Oprea. As an application,…

The central question of knot theory is that of distinguishing links up to isotopy. The first polynomial invariant of links devised to help answer this question was the Alexander polynomial (1928). Almost a century after its introduction, it…

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

We prove that a knot is the unknot if and only if its reduced Khovanov cohomology has rank 1. The proof has two steps. We show first that there is a spectral sequence beginning with the reduced Khovanov cohomology and abutting to a knot…

In a group, a non-trivial element is called a generalized torsion element if some non-empty finite product of its conjugates equals to the identity. We say that a knot has generalized torsion if its knot group admits such an element. For a…

Manturov recently introduced the idea of a free knot, i.e. an equivalence class of virtual knots where equivalence is generated by crossing change and virtualization moves. He showed that if a free knot diagram is associated to a graph that…

Given a knot in the three-sphere, is it possible to unknot it by performing a single twist, and if so, what are the possible linking numbers of such a twist? We develop obstructions to unknotting using a twist of a specified linking number.…

Starting from the working hypothesis that both physics and the corresponding mathematics have to be described by means of discrete concepts on the Planck-scale, one of the many problems one has to face in this enterprise is to find the…

The {\it total irregularity} of a simple undirected graph $G$ is defined as ${\rm irr}_t(G) =$ $\frac{1}{2}\sum_{u,v \in V(G)}$ $\left| d_G(u)-d_G(v) \right|$, where $d_G(u)$ denotes the degree of a vertex $u \in V(G)$. Obviously, ${\rm…

We refine the Polyak-Viro Gauss diagram formula for the Vassiliev invariant of order two in a very simple way for the 2-cable of a framed long knot. Surprisingly, the resulting isotopy invariant of framed knots can detect already the…

An unfolding of a polyhedron along its edges is called a vertex unfolding if adjacent faces are allowed to be connected at not only an edge but also a vertex. Demaine et al showed that every triangulated polyhedron has a vertex unfolding.…

A gordian unlink is a finite number of unknots that are not topologically linked, each with prescribed length and thickness, and that cannot be disentangled into the trivial link by an isotopy preserving length and thickness throughout. In…