Related papers: Verification Of The Jones Unknot Conjecture Up To …

In this article we shall give an account of certain developments in knot theory which followed upon the discovery of the Jones polynomial in 1984. The focus of our account will be recent glimmerings of understanding of the topological…

We describe a way of encoding a Kauffman state as a set of tuples, similar to a Gauss code. Then we describe a procedure for using these state codes to determine the unoriented genus and crosscap number of any prime alternating knot or…

An open question asks if every knot of 4-genus g_s can be changed into a slice knot by g_s crossing changes. A counterexample is given.

A knot K is called n-adjacent to the unknot, if K admits a projection containing n generalized crossings such that changing any m (no larger than n) of them yields a projection of the unknot. We show that a non-trivial satellite knot K is…

In this paper, the authors give an unknotting sequence for torus knots and also provide unknotting numbers of $_n14_{17191}, \ _n14_{14274}, \ _n14_{18351}, \ _n14_{24498}$ and some other knots from the knot table of Hoste-Thistlethwite.

The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway…

We develop a word mechanism applied in knot and link diagrams for the illustration of a diagrammatic property. We also give a necessary condition for determining incompressible and pairwise incompressible surfaces, that are embedded in knot…

In this paper, we prove a formula for the 2-head of the colored Jones polynomial for an infinite family of pretzel knots. Following Hall, the proof utilizes skein-theoretic techniques and a careful examination of higher order stability…

A multi-crossing (or n-crossing) is a singular point in a projection at which n strands cross so that each strand bisects the crossing. We generalize the classic result of Kauffman, Murasugi, and Thistlethwaite, which gives the upper bound…

We formulate a stability conjecture for the coefficients of the colored Jones polynomial of a knot, colored by irreducible representations in a fixed ray of a simple Lie algebra, and verify it for all torus knots and all simple Lie algebras…

We study cosmetic crossings in knots of genus one and obtain obstructions to such crossings in terms of knot invariants determined by Seifert matrices. In particular, we prove that for genus one knots the Alexander polynomial and the…

We use Heegaard Floer homology to obtain bounds on unknotting numbers. This is a generalisation of Ozsvath and Szabo's obstruction to unknotting number one. We determine the unknotting numbers of 9_10, 9_13, 9_35, 9_38, 10_53, 10_101 and…

We confirm the AJ conjecture [Ga04] that relates the A-polynomial and the colored Jones polynomial for those hyperbolic knots satisfying certain conditions. In particular, we show that the conjecture holds true for some classes of…

The first and last named authors have demonstrated the existence of knots for which every integral slope is non-characterizing. In this short note, we extend this result in two ways. There exists a knot that shares for every integer n the…

We show that there are infinitely many pairs of alternating pretzel knots whose Jones polynomials are identical.

Using the recent Gauss diagram formulas for Vassiliev invariants of Polyak-Viro-Fiedler and combining these formulas with the Bennequin inequality, we prove several inequalities for positive knots relating their Vassiliev invariants, genus…

We use the Heegaard Floer obstructions defined by Grigsby, Ruberman, and Strle to show that forty-six of the sixty-seven knots through eleven crossings whose concordance orders were previously unknown have infinite concordance order.

We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an…

We apply Bayesian optimization and reinforcement learning to a problem in topology: the question of when a knot bounds a ribbon disk. This question is relevant in an approach to disproving the four-dimensional smooth Poincar\'e conjecture;…

We present three "hard" diagrams of the unknot. They require (at least) three extra crossings before they can be simplified to the trivial unknot diagram via Reidemeister moves in $\mathbb{S}^2$. Both examples are constructed by applying…