Related papers: Quadrisecants give new lower bounds for the ropele…
A revised proof of the author's earlier result is given. It is shown that a boundary surface-link in the 4-sphere is a ribbon surface-link if the surface-link obtained from it by surgery along a pairwise nontrivial fusion 1-handle system is…
We use a version of simulated annealing with knot-type preserving moves to find polygonal representatives of various knot types with low stick number. These give better bounds on stick numbers of prime knots through 10 crossings, and for…
We obtain a sharp upper bound for the length of arbitrary non-associative algebra and present an example demonstrating the sharpness of our bound. To show this we introduce a new method of characteristic sequences based on linear algebra…
We introduce the notion of slice depth of a 2-knot K, which is the minimal integer n such that K is n-slice. We give an upper bound for the slice depth of the n-twist spin of a classical knot which belongs to several specific classes,…
This paper introduces the concept of a Fourier knot. A Fourier knot is a knot that is represented by a parametrized curve in three dimensional space such that the coordinate functions are finite Fourier series in the parameter. The…
Agol proved that ribbon concordance forms a partial ordering on the set of knots in the $3$-sphere. In this paper, we prove that all tight fibered knots are minimal in this partially ordered set. We also give the table of prime minimal…
We improve the lower bound for the minimum number of colors for linear Alexander quandle colorings of a knot given in Theorem 1.2 of Colorings beyond Fox: The other linear Alexander quandles (Linear Algebra and its Applications, Vol. 548,…
For a polygonal knot K, it is shown that a tube of radius R(K), the polygonal thickness radius, is an embedded torus. Given a thick configuration K, perturbations of size r<R(K) define satellite structures, or local knotting. We explore…
Knots and links have been considered to be useful models for structural analysis of molecular chains such as DNA and proteins. One quantity that we are interested on molecular links is the minimum number of monomers necessary to realize…
It is shown that the diameter of the boundary slope set is bounded from above by the twice of the minimal crossing number for a Montesinos knot.
The problem of a suspended rope wrapped around a fixed cylinder is studied. If the suspension force is larger than a certain threshold (which is larger than the weight of the rope), the rope would remain tightly wrapped around the cylinder.…
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…
In this paper we will show how to classify Legendrian and transverse knots in the knot type of "sufficiently positive" cables of a knot in terms of the classification of the underlying knot. We will also completely explain the phenomena of…
We give the bridge indices for 11-crossing prime knots and give a minimal bridge projection for each of these knots. The results on the indices may be easily summarized: all of these knots that are not rational knots or Montesinos knots…
For an arbitrary (3,L) QC-LDPC code with a girth of twelve, a tight lower bound of the consecutive lengths is proposed. For an arbitrary length above the bound the resultant code necessarily has a girth of twelve, and for the length meeting…
A knot is called minimal if its knot group admits epimorphisms onto the knot groups of only the trivial knot and itself. In this paper, we determine which two-bridge knot $\mathfrak{b}(p,q)$ is minimal where $q \leq 6$ or $p \leq 100$.
We study the formation of knots on a macroscopic ball-chain, which is shaken on a horizontal plate at 12 times the acceleration of gravity. We find that above a certain critical length, the knotting probability is independent of chain…
We give a complete characterization of the topological slice status of odd 3-strand pretzel knots, proving that an odd 3-strand pretzel knot is topologically slice if and only if either it is ribbon or has trivial Alexander polynomial. (By…
We develop a reinforcement learning pipeline for simplifying knot diagrams. A trained agent learns move proposals and a value heuristic for navigating Reidemeister moves. The pipeline applies to arbitrary knots and links; we test it on…
A pretzel knot $K$ is called $odd$ if all its twist parameters are odd, and $mutant$ $ribbon$ if it is mutant to a simple ribbon knot. We prove that the family of odd, 5-stranded pretzel knots satisfies a weaker version of the Slice-Ribbon…