Related papers: Erratum: On iterated torus knots and transversal k…
In this note, we attempt to find counterexamples to the conjecture that the ideal form of a knot, that which minimizes its contour length while respecting a no-overlap constraint, also minimizes the volume of the knot, as determined by its…
If a graph can be drawn on the torus so that every two independent edges cross an even number of times, then the graph can be embedded on the torus.
This is erratum of the paper [Phys. Rev. Lett. {\bf 84}, 4260 (2000)]
The motivation for this work was to construct a nontrivial knot with trivial Jones polynomial. Although that open problem has not yielded, the methods are useful for other problems in the theory of knot polynomials. The subject of the…
In 2003, Hikami and Kirillov uncovered an intriguing connection between torus knots $\mathcal{K}_{(P,Q)}$ and Virasoro minimal models $\mathcal{M}(P,Q)$ by relating the Kashaev invariants of the knots to the characters of the corresponding…
The A-polynomial of a knot is defined in terms of SL(2,C) representations of the knot group, and encodes information about essential surfaces in the knot complement. In 2005, Dunfield-Garoufalidis and Boyer-Zhang proved that it detects the…
We use microlocal sheaf theory to show that if two knots have Legendrian isotopic conormal tori, then the knots are isotopic or mirror images.
Simple physics ideas are used to derive an exact expression for a flat connection on the complement of a torus knot. The result is of some mathematical importance in the context of constructing representations of the knot group -- a…
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…
We prove a formula for the involutive concordance invariants of the cabled knots in terms of that of the companion knot and the pattern knot. As a consequence, we show that any iterated cable of a knot with parameters of the form (odd,1) is…
We show that a torus knot which is not 2-bridge has a unique irreducible bridge splitting of positive genus.
The present paper is an addendum to "Spherical structures on torus knots and links", arXiv:1008.0312, and concerns more general case of torus knot and link cone-manifolds.
The only knots that are tunnel number one and genus one are those that are already known: 2-bridge knots obtained by plumbing together two unknotted annuli and the satellite examples classified by Eudave-Munoz and by Morimoto-Sakuma. This…
For any knot with genus one and unknotting number one, other than the figure-eight knot, we prove that there is exactly one way to unknot it by means of a crossing change. In the case of the figure-eight knot, we prove that there are…
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 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 classify Legendrian torus knots and figure eight knots in the tight contact structure on the 3-sphere up to Legendrian isotopy. As a corollary to this we also obtain the classification of transversal torus knots and figure eight knots up…
In this article, the author provides full details of the proof of the concordance/isotopy problem. The first published proof, [5], accomplished this task only partially since there was an error, see the erratum [6], which damaged the main…
The aim of this survey article is to highlight several notoriously intractable problems about knots and links, as well as to provide a brief discussion of what is known about them.
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.…