Related papers: Classification of knots in T x I with at most 4 cr…

The list of knots with up to 10 crossings is commonly referred to as the Rolfsen Table. This paper presents a way to generate the Rolfsen table in a simple, clear, and reproducible manner. The methods we use are similar to those used by J.…

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 genus-1 1-bridge knot in the 3-sphere, that is, a (1,1)-knot, a middle tunnel is a tunnel that is not an upper or lower tunnel for some (1,1)-position. Most torus knots have a middle tunnel, and non-torus-knot examples were obtained…

Every torus knot can be represented as a Fourier-(1,1,2) knot which is the simplest possible Fourier representation for such a knot. This answers a question of Kauffman and confirms the conjecture made by Boocher, Daigle, Hoste and Zheng.…

We enumerate and show tables of minimal diagrams for all prime knots up to the triple-crossing number equal to five. We derive a minimal generating set of oriented moves connecting triple-crossing diagrams of the same oriented knot. We also…

We present a complete classification of spherical knotoids with up to six crossings and conjecture that our classification up to seven crossings is complete. Our work extends the tradition of knot tabulation to the setting of knotoids…

We develop a purely combinatorial framework for the systematic enumeration of knot and link diagrams supported on the thickened torus $T^2\times I$. Using the theory of maps on surfaces, cellular $4$--regular torus projections are encoded…

This thesis develops some general calculational techniques for finding the orders of knots in the topological concordance group C. The techniques currently available in the literature are either too theoretical, applying to only a small…

We use matchings on Lyndon words to classify flat knots up to 8 crossings. Using flat knots invariants such as the based matrix, the $\phi$-invariant, the flat arrow polynomial, and the flat Jones-Krushkal polynomial, we distinguish all…

We introduce a new way to tabulate knots by representing knot diagrams using a pair of planar trees. This pair of trees have their edges labeled by integers, they have no valence 2 vertices, and they have the same number of valence 1…

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…

In this paper we present a systematic method to generate prime knot and prime link minimal triple-point projections, and then classify all classical prime knots and prime links with triple-crossing number at most four. We also extend the…

For every odd integer $N$ we give an explicit construction of a polynomial curve $\cC(t) = (x(t), y (t))$, where $\deg x = 3$, $\deg y = N + 1 + 2\pent N4$ that has exactly $N$ crossing points $\cC(t_i)= \cC(s_i)$ whose parameters satisfy…

We present an enhanced prime decomposition theorem for knots that gives the isotopy classes of composite knots that can be constructed from a given list of prime factors (allowing for the mirroring and orientation reversing for each…

We study the degree of polynomial representations of knots. We give the lexicographic degree of all two-bridge knots with 11 or fewer crossings. First, we estimate the total degree of a lexicographic parametrisation of such a knot. This…

We classify knot traces with trisection genus at most 2. We give infinitely many knots whose traces have trisection genus 3, and infinitely many knots whose traces have trisection genus 4. We also show that there exist infinite families of…

We introduce a framework to analyze knots and links in an unmarked solid torus. We discuss invariants that detect when such links are equivalent under an ambient homeomorphism, and show that the multivariable Alexander polynomial is such in…

Ascending numbers are determined for 64 knots with at most n=10 crossings. After proving the theorem about the signature of alternating knot families, we distinguished all families of knots obtained from generating alternating knots with at…

We introduce an alternative stratification of knots: by the size of lattice on which a knot can be first met. Using this classification, we find ratio of unknots and knots with more than 10 minimal crossings inside different lattices and…

This is the second of three papers that refine and extend portions of our earlier preprint, "The depth of a knot tunnel." Together, they rework the entire preprint. The theory of tunnel number 1 knots that we introduced in "The tree of knot…