Related papers: Crossing numbers of cable knots

For a knot K, the concordance crosscap number, c(K), is the minimum crosscap number among all knots concordant to K. Building on work of G. Zhang, which studied the determinants of knots with c(K) < 2, we apply the Alexander polynomial to…

We derive an upper bound on the density of Jones polynomials of knots modulo a prime number $p$, within a sufficiently large degree range: $4/p^7$. As an application, we classify knot Jones polynomials modulo two of span up to eight.

Using computer calculations and working with representatives of pretzel tangles we established general adequacy criteria for different classes of knots and links. Based on adequate graphs obtained from all Kauffman states of an alternating…

We determine the crossing number of polynomial size curve systems on standard surfaces, in terms of the genus, up to high precision.

It has been conjectured that the algebraic crossing number of a link is uniquely determined in minimal braid representation. This conjecture is true for many classes of knots and links. The Morton-Franks-Williams inequality gives a lower…

This paper is about the clock number of a knot. First we define the clock number by using states of a knot defined by Kauffman. Next we show that if K is a prime knot, its clock number is greater than or equal to its crossing number.…

Using an involved study of the Jones polynomial, we determine, as our main result, the crossing numbers of (prime) amphicheiral knots. As further applications, we show that several classes of links, including semiadequate links and…

We introduce the warping crossing polynomial of an oriented knot diagram by using the warping degrees of crossing points of the diagram. Given a closed transversely intersected plane curve, we consider oriented knot diagrams obtained from…

We introduce tensor network contraction algorithms for the evaluation of the Jones polynomial of arbitrary knots. The value of the Jones polynomial of a knot maps to the partition function of a $q$-state Potts model defined as a planar…

We point out that the strong slope conjecture implies that the degrees of the colored Jones knot polynomials detect the figure eight knot. Furthermore, we propose a characterization of alternating knots in terms of the Jones period and the…

In this work we establish the tightest lower bound up-to-date for the minimal crossing number of a satellite knot based on the minimal crossing number of the companion used to build the satellite. If $M$ is the wrapping number of the…

For a torus knot K, we bound the crosscap number c(K) in terms of the genus g(K) and crossing number n(K): c(K) \leq [(g(K)+9)/6] and c(K) \leq [(n(K) + 16)/12]. The (6n-2,3) torus knots show that these bounds are sharp.

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 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…

We study the asymptotic behavior of the $N$-dimensional colored Jones polynomial of a cable of the figure-eight knot, evaluated at $\exp(\xi/N)$ for a real number $\xi$. We show that if $\xi$ is sufficiently large, the colored Jones…

We extend the table of Garoufalidis, Le and Zagier concerning conjectural Rogers-Ramanujan type identities for tails of colored Jones polynomials to all alternating knots up to 10 crossings. We then prove these new identities using q-series…

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…

We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.

Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…

For a knot or link K, let L(K) be the ropelength of K and Cr(K) be the crossing number of K. In this paper, we show that there exists a constant a>0 such that L(K) is bounded above by a Cr(K) ln^5 (Cr(K)) for any knot K. This result shows…