相关论文: Jones diameter and crossing number of knots

We use the degree of the colored Jones knot polynomials to show that the crossing number of a $(p,q)$-cable of an adequate knot with crossing number $c$ is larger than $q^2\, c$. As an application we determine the crossing number of…

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 study the behavior of the degree of the colored Jones polynomial and the boundary slopes of knots under the operation of cabling. We show that, under certain hypothesis on this degree, if a knot $K$ satisfies the Slope Conjecture then a…

We give sharp two-sided linear bounds of the crosscap number (non-orientable genus) of alternating links in terms of their Jones polynomial. Our estimates are often exact and we use them to calculate the crosscap numbers for several…

We prove that the Jones diameter of a link is twice its crossing number whenever the breadth of its Jones polynomial equals the difference between the crossing number and the Turaev genus. This implies that such link is adequate, as per the…

We proved by computer enumeration that the Jones polynomial distinguishes the unknot for knots up to 22 crossings. Following an approach of Yamada, we generated knot diagrams by inserting algebraic tangles into Conway polyhedra, computed…

Garoufalidis conjectured a relation between the boundary slopes of a knot and its colored Jones polynomials. According to the conjecture, certain boundary slopes are detected by the sequence of degrees of the colored Jones polynomials. We…

The Jones unknot conjecture states that the Jones polynomial distinguishes the unknot from nontrivial knots. We prove it for knots up to 23 crossings.

We give examples of knots with some unusual properties of the crossing number of positive diagrams or strand number of positive braid representations. In particular we show that positive braid knots may not have positive minimal (strand…

Extending upon our previous work, we verify the Jones Unknot Conjecture for all knots up to $24$ crossings. We describe the method of our approach and analyze the growth of the computational complexity of its different components.

A conjecture proposed by J. Tripp in 2002 states that the crossing number of any knot coincides with the canonical genus of its Whitehead double. In the meantime, it has been established that this conjecture is true for a large class of…

A well-known algorithm for unknotting knots involves traversing a knot diagram and changing each crossing that is first encountered from below. The minimal number of crossings changed in this way across all diagrams for a knot is called the…

We give a new upper bound on the maximum degree of the Jones polynomial of a fibered positive link. In particular, we prove that the maximum degree of the Jones polynomial of a fibered positive knot is at most four times the minimum degree.…

We show for an alternating knot the minimal boundary slope of an essential spanning surface is given by the signature plus twice the minimum degree of the Jones polynomial and the maximal boundary slope of an essential spanning surface is…

We establish a characterization of adequate knots in terms of the degree of their colored Jones polynomial. We show that, assuming the Strong Slope conjecture, our characterization can be reformulated in terms of "Jones slopes" of knots and…

The extreme degrees of the colored Jones polynomial of any link are bounded in terms of concrete data from any link diagram. It is known that these bounds are sharp for semi-adequate diagrams. One of the goals of this paper is to show the…

This monograph derives direct and concrete relations between colored Jones polynomials and the topology of incompressible spanning surfaces in knot and link complements. Under mild diagrammatic hypotheses that arise naturally in the study…

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 show that a finite numerical boundary slope of an essential surface in the exterior of a Montesinos knot is bounded above and below in terms of the numbers of positive/negative crossings of a specific minimal diagram of the knot.

We show that for genus one knots the Alexander polynomial and the homology of the double cover branching over the knot provide obstructions to cosmetic crossings. As an application we prove the nugatory crossing conjecture for the…