Related papers: Unlinking Number and Unlinking Gap

We introduce birack brackets, skein invariants of birack-colored framed classical and virtual knots and links with values in a commutative unital ring. The multiset of birack bracket values over the homset from a framed link's fundamental…

We determine the rational Khovanov bigraded homology groups of all Kanenobu knots. Also, we determine the crossing number for all Kanenobu knots $K(p,q)$ with $pq > 0$ or $|pq|\leq \max \{|p|, |q|\}$. In the case where $pq < 0$ and $|pq| >…

We show that the crossing number of any link that is known to be quasi-alternating is less than or equal to its determinant. Based on this, we conjecture that the crossing number of any quasi-alternating link is less than or equal to its…

We prove that the length of any gap in the differential grading of the Khovanov homology of any quasi-alternating link is one. As a consequence, we obtain that the length of any gap in the Jones polynomial of any such link is one. This…

We say that a link $L_1$ is an s-major of a link $L_2$ if any diagram of $L_1$ can be transformed into a diagram of $L_2$ by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime…

There are infinitely many pretzel links with the same Alexander polynomial (actually with trivial Alexander polynomial). By contrast, in this note we revisit the Jones polynomial of pretzel links and prove that, given a natural number S,…

We present, to the best of the authors' knowledge, all known results for the (planar) crossing numbers of specific graphs and graph families. The results are separated into various categories; specifically, results for general graph…

A rational knot or link can be put into a standard alternating format which has horizontal and vertical twist sites (double helices). The number and type of these twist sites are determined by terms of next-to-highest $z$-degree in…

A knotted ribbon is one of physical aspect of a knot. A folded ribbon knot is a depiction of a knot obtained by folding a long and thin rectangular strip to become flat. The ribbonlength of a knot type can be defined as the minimum length…

The ropelength of a knot is the minimum length required to tie it. Computational upper bounds have previously been computed for every prime knot with up to 11 crossings. Here, we present ropelength measurements for the 2176 knots with 12…

We introduced concept of meander knots, 2-component meander links and multi-component meander links and derived different families of meander knots and links from open meanders with at most 16 crossings. We also defined semi-meander knots…

We present two families of knots which have straight number higher than crossing number. In the case of the second family, we have computed the straight number explicitly. We also give a general theorem about alternating knots that states…

A classical result states that the determinant of an alternating link is equal to the number of spanning trees in a checkerboard graph of an alternating connected projection of the link. We generalize this result to show that the…

We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…

We examine the structure and dimensionality of the Jones polynomial using manifold learning techniques. Our data set consists of more than 10 million knots up to 17 crossings and two other special families up to 2001 crossings. We introduce…

We introduce a "deformation" of plumbing. We also define a structure of data used in a calculation by computer aid of the crosscap numbers of alternating knots.

From the link Floer complex of a link $K$, we extract a lower bound $t_q'(K)$ for the rational unknotting number of $K$ (i.e. the minimum number of rational replacements required to unknot $K$). Moreover, we show that the torsion…

We explore the application of automated reasoning techniques to unknot detection, a classical problem of computational topology. We adopt a two-pronged experimental approach, using a theorem prover to try to establish a positive result…

This paper gives infinitely many examples of unknot diagrams that are hard, in the sense that the diagrams need to be made more complicated by Reidemeister moves before they can be simplified. In order to construct these diagrams, we prove…

We prove that the tunnel number of a satellite chain link with a number of components higher than or equal to twice the bridge number of the companion is as small as possible among links with the same number of components. We prove this…