Related papers: Crossing numbers of cable knots

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…

Using the vertex model approach for braid representations, we compute polynomials for spin-1 placed on hyperbolic knots up to 15 crossings. These polynomials are referred to as 3-colored Jones polynomials or adjoint Jones polynomials.…

We study the AJ conjecture for $(r,2)$-cables of a knot, where $r$ is an odd integer. Using skein theory, we show that the AJ conjecture holds true for most $(r,2)$-cables of some classes of two-bridge knots and pretzel knots.

The ribbon number of a knot is the minimum number of ribbon singularities among all ribbon disks bounded by that knot. In this paper, we build on the systematic treatment of this knot invariant initiated in recent work of Friedl, Misev, and…

In this paper, we enumerate the number of oriented rational knots and the number of oriented rational links with any given crossing number and minimum genus. This allows us to obtain a precise formula for the average minimal genus of…

Kalfagianni and Lee found two-sided bounds for the crosscap number of an alternating link in terms of certain coefficients of the Jones polynomial. We show here that we can find similar two-sided bounds for the crosscap number of Conway…

We provide a new bound on the maximum degree of the Jones polynomial of a positive link with second Jones coefficient equal to $\pm 1$ or $\pm 2$. This builds upon the result of our previous work, in which we found such a bound for positive…

We have developed a reinforcement learning agent that often finds a minimal sequence of unknotting crossing changes for a knot diagram with up to 200 crossings, hence giving an upper bound on the unknotting number. We have used this to…

We consider diagrams of links in $S^2$ obtained by projection from $S^3$ with the Hopf map and the minimal crossing number for such diagrams. Knots admitting diagrams with at most one crossing are classified. Some properties of these knots…

We define and compare several natural ways to compute the bridge number of a knot diagram. We study bridge numbers of crossing number minimizing diagrams, as well as the behavior of diagrammatic bridge numbers under the connected sum…

Ito-Takimura recently defined a splice-unknotting number $u^-(D)$ for knot diagrams. They proved that this number provides an upper bound for the crosscap number of any prime knot, asking whether equality holds in the alternating case. We…

We study near-alternating links whose diagrams satisfy conditions generalized from the notion of semi-adequate links. We extend many of the results known for adequate knots relating their colored Jones polynomials to the topology of…

Knotoids are open ended knot diagrams regarded up to Reidemeister moves and isotopies. The notion is introduced by V.~Turaev in 2012. Two most important numeric characteristics of a knotoid are the crossing number and the height. The latter…

The AJ conjecture relates the A-polynomial and the colored Jones polynomial of a knot in the 3-sphere. It has been verified for some classes of knots, including all torus knots, most double twist knots, (-2,3,6n \pm 1)-pretzel knots, and…

We define the concordance crosscap number of a knot as the minimum crosscap number among all the knots concordant to the knot. The four-dimensional crosscap number is the minimum first Betti number of non-orientable surfaces smoothly…

We give examples showing that Kidwell's inequality for the maximal degree of the Brandt-Lickorish-Millett-Ho polynomial is in general not sharp.

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…

The Slope Conjecture proposed by Garoufalidis asserts that the degree of the colored Jones polynomial determines a boundary slope, and its refinement, the Strong Slope Conjecture proposed by Kalfagianni and Tran asserts that the linear term…

The unknotting number of knots is a difficult quantity to compute, and even its behavior under basic satelliting operations is not understood. We establish a lower bound on the unknotting number of cable knots and iterated cable knots…

We study transport through multiply coupled carbon nano-tubes (quantum wires) and compute the conductances through the two wires as a function of the two gate voltages $g_1$ and $g_2$ controlling the chemical potential of the electrons in…