Related papers: Polynomial algorithm for alternating link equivale…
Virtual knot theory is a generalization of knot theory which is based on Gauss chord diagrams and link diagrams on closed oriented surfaces. A twisted knot is a generalization of a virtual knot, which corresponds to a link diagram on a…
A braid-like isotopy for links in 3-space is an isotopy which uses only those Reidemeister moves which occur in isotopies of braids. We define a refined Jones polynomial and its corresponding Khovanov homology which are, in general, only…
We adapt Thistlethwaite's alternating tangle decomposition of a knot diagram to identify the potential extreme terms in its bracket polynomial, and give a simple combinatorial calculation for their coefficients, based on the intersection…
In this paper we are interested in symmetries of alternating knots, more precisely in those related to achirality. We call the following statement Tait's Conjecture on alternating -achiral knots: Let K be an alternating -achiral knot. Then…
This article provides an overview of relative strengths of polynomial invariants of knots and links, such as the Alexander, Jones, Homflypt, and Kaufman two-variable polynomial, Khovanov homology, factorizability of the polynomials, and…
We discuss the possibility of the existence of finite algorithms that may give distinct knot classes. In particular we present two attempts for such algorithms which seem promising, one based on knot projections on a plane, the other on…
Classical knot theory deals with {\em diagrams} and {\em invariants}. By means of horizontal {\em trisecants}, we construct a new theory of classical braids with invariants valued in {\em pictures}. These pictures are closely related to…
In this paper, we apply Kauffman bracket skein algebras to develop a theory of skein adequate links in thickened surfaces. We show that any alternating link diagram on a surface is skein adequate. We apply our theory to establish the first…
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…
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 study inequalities between integer-valued knot invariants arising from classical knot theory, four-dimensional topology, knot homologies, and knot polynomials. We present a directed graph consisting of 48 inequalities between 33 knot…
We investigate the coefficients of the highest and lowest terms (also called the head and the tail) of the colored Jones polynomial and show that they stabilize for alternating links and for adequate links. To do this we apply techniques…
Knots naturally appear in continuous dynamical systems as flow periodic trajectories. However, discrete dynamical systems are also closely connected with the theory of knots and links. For example, for Pixton diffeomorphisms, the…
We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, {\sc…
We investigate Fox's trapezoidal conjecture for alternating links. We show that it holds for diagrammatic Murasugi sums of special alternating links, where all sums involved have length less than three (which includes diagrammatic…
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…
We prove that twisting any quasi-alternating link $L$ with no gaps in its Jones polynomial $V_L(t)$ at the crossing where it is quasi-alternating produces a link $L^{*}$ with no gaps in its Jones polynomial $V_{L^*}(t)$. This leads us to…
In the graphical calculus of planar string diagrams, equality is generated by exchange moves, which swap the heights of adjacent vertices. We show that left- and right-handed exchanges each give strongly normalizing rewrite strategies for…
In this paper we apply the twisted Alexander polynomial to study the fibering and genus detecting problems for oriented links. In particular we generalize a conjecture of Dunfield, Friedl and Jackson on the torsion polynomial of hyperbolic…
The estimation of correspondences between two images resp. point sets is a core problem in computer vision. One way to formulate the problem is graph matching leading to the quadratic assignment problem which is NP-hard. Several so called…