Related papers: Sampling Lissajous and Fourier knots

We classify all knot diagrams of genus two and three, and give applications to positive, alternating and homogeneous knots, including a classification of achiral genus 2 alternating knots, slice or achiral 2-almost positive knots, a proof…

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 prove that a crossing change along a double point circle on a 2-knot is realized by ribbon-moves for a knotted torus obtained from the 2-knot by attaching a 1-handle. It follows that any 2-knots for which the crossing change is an…

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…

This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…

A Chebyshev knot is a knot which admits a parametrization of the form $ x(t)=T_a(t); \ y(t)=T_b(t) ; \ z(t)= T_c(t + \phi), $ where $a,b,c$ are pairwise coprime, $T_n(t)$ is the Chebyshev polynomial of degree $n,$ and $\phi \in \RR .$…

We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…

Knot and link diagrams are projections of one or more 3-dimensional simple closed curves into $R^2$, such that no more than two points project to the same point in $R^2$. These diagrams are drawings of 4-regular plane multigraphs. Knots are…

We study simple, knotted and linked torus windings that are made of tubes of finite thickness. Knots which have the shortest rope length are often denoted ideal structures. Conventionally, the ideal structure are found by rope shortening…

In this article we study a partial ordering on knots in the 3-sphere where K_1 is greater than or equal to K_2 if there is an epimorphism from the knot group of K_1 onto the knot group of K_2 which preserves peripheral structure. If K_1 is…

We prove that for 2-bridge knots, the diameter, D, of the set of boundary slopes is twice the crossing number, c. This constitutes partial verification of a conjecture that, for all knots in S^3, D is at most 2c.

In the present note, we will show that there are infinitely many composite twisted torus knots.

A knot is a circle piecewise-linearly embedded into the 3-sphere. The topology of a knot is intimately related to that of its exterior, which is the complement of an open regular neighborhood of the knot. Knots are typically encoded by…

We prove that each overtwisted contact structure has knot types that are represented by infinitely many distinct transverse knots all with the same self-linking number. In some cases, we can even classify all such knots. We also show…

We describe an algorithm to find ribbon disks for alternating knots, and the results of a computer implementation of this algorithm. The algorithm is underlain by a slice link obstruction coming from Donaldson's diagonalisation theorem. It…

We present a combinatorial method for a calculation of knot Floer homology with Z-coefficient of (1,1)-knots, and then demonstrate it for non-alternating (1,1)-knots with ten crossings and the pretzel knots of type (-2,m,n). Our…

We consider complex 3D polarizations in the interference of several vector wave fields with different commensurable frequencies and polarizations. We show that the resulting polarizations can form knots, and interfering three waves is…

We develop a topological model of knots and links arising from a single (or multiple processive) round(s) of recombination starting with an unknot, unlink, or (2,m)-torus knot or link substrate. We show that all knotted or linked products…

A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…

We extend an approach of Beliakova for computing knot Floer homology and implement it in a publicly available computer program. We review the main programming and optimization methods used. Our program is then used to check that the Floer…