Related papers: Knot Tightening By Constrained Gradient Descent
The Knot Entropy Conjecture states that the exponential growth rate of the number of $n$-edge lattice polygons with knot-type $K$ is the same as that for unknot polygons. Moreover, the next order growth follows a power law in $n$ with an…
The most tight conformations of prime knots are found with the use of the SONO algorithm. Their curvature and torsion profiles are calculated. Symmetry of the knots is analysed. Connections with the physics of polymers are discussed.
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…
The ropelength of a knot is the minimum length required to tie it. Computational upper bounds have previously been computed for every prime knot with up to 11 crossings. Here, we present ropelength measurements for the 2176 knots with 12…
We compose the table of knots in the thickened torus T x I having diagrams with at most 4 crossings. The knots are constructed by the three-step process. First we list regular graphs of degree 4 with at most 4 vertices, then for each graph…
We prove the fractal crumpled structure of collapsed unknotted polymer ring. In this state the polymer chain forms a system of densely packed folds, mutually separated in all scales. The proof is based on the numerical and analytical…
New results on the groundstate energy of tight, magnetic knots are presented. Magnetic knots are defined as tubular embeddings of the magnetic field in an ideal, perfectly conducting, incompressible fluid. An orthogonal, curvilinear…
We examine the possibility of approximating Maximum Vertex-Disjoint Shortest Paths. In this problem, the input is an edge-weighted (directed or undirected) $n$-vertex graph $G$ along with $k$ terminal pairs…
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 prove the first polynomial bound on the number of monotonic homotopy moves required to tighten a collection of closed curves on any compact orientable surface, where the number of crossings in the curve is not allowed to increase at any…
A gordian unlink is a finite number of unknots that are not topologically linked, each with prescribed length and thickness, and that cannot be disentangled into the trivial link by an isotopy preserving length and thickness throughout. In…
We give two different, statistically consistent definitions of the length l of a prime knot tied into a polymer ring. In the good solvent regime the polymer is modelled by a self avoiding polygon of N steps on cubic lattice and l is the…
An alternating torus knot or link may be constructed from a repeating double helix after connecting its two ends. A structure with additional helices may be closed to form a non-alternating torus knot or link. Previous work has optimized…
We develop a framework for discrete p-density and compression-radius profiles of lattice knots. For lattice polygons representing a fixed knot type, we define scale-free density quantities by dividing lattice length by chord-length spread…
How should we thread a single string through a set of tubes so that pulling the string taut self-assembles the tubes into a desired graph? While prior work [ITCS 2024] solves this problem with the goal of minimizing the length of string, we…
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 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…
Let $\mbox{Len}(K)$ be the minimum length of a knot on the cubic lattice (namely the minimum length necessary to construct the knot in the cubic lattice). This paper provides upper bounds for $\mbox{Len}(K)$ of a nontrivial knot $K$ in…
Squeezed knots are those knots that appear as slices of genus-minimizing oriented smooth cobordisms between positive and negative torus knots. We show that this class of knots is large and discuss how to obstruct squeezedness. The most…
We present experimental results on knotting in off-lattice self-avoiding polygons in the bead-chain model. Using Clisby's tree data structure and the scale-free pivot algorithm, for each $k$ between $10$ and $27$ we generated $2^{43-k}$…