Related papers: A principle for ideal torus knots
We present a general construction of divergence-free knotted vector fields from complex scalar fields, whose closed field lines encode many kinds of knots and links, including torus knots, their cables, the figure-8 knot and its…
We develop the concept of Cartan ribbons together with a rolling-based method to ribbonize and approximate any given surface in space by intrinsically flat ribbons. The rolling requires that the geodesic curvature along the contact curve on…
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 show that any non-minimal bridge decomposition of a torus knot is stabilized and that $n$-bridge decompositions of a torus knot are unique for any integer $n$. This implies that a knot in a bridge position is a torus knot if and only if…
We model the typical behavior of knots and links using grid diagrams. Links are ubiquitous in the sciences, and their "normal" or "typical" behavior is of significant importance in understanding situations such as the topological state of…
When a ribbon or tube is twisted far enough it forms buckles and wrinkles. Its new geometry can be strikingly ordered, or hopelessly disordered. Here we study this process in a tube with hybrid boundary conditions: one end a cylinder, and…
Hyperfinite knots, or limits of equivalence classes of knots induced by a knot invariant taking values in a metric space, were introduced in a previous article by the author. In this article, we present new examples of hyperfinite knots…
The most tight conformation of the trefoil knot found by the SONO algorithm is presented. Structure of the set of its self-contact points is analyzed.
The crosscap number of a knot in the 3-sphere is the minimal genus of non-orientable surface bounded by the knot. We determine the crosscap numbers of torus knots.
The probability of a random polygon (or a ring polymer) having a knot type $K$ should depend on the complexity of the knot $K$. Through computer simulation using knot invariants, we show that the knotting probability decreases exponentially…
We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason - the problem of "super…
S. Satoh has defined a construction to obtain a ribbon torus knot given a welded knot. This construction is known to be surjective. We show that it is not injective. Using the invariant of the peripheral structure, it is possible to provide…
The topological analysis of chaos based on a knot-theoretic characterization of unstable periodic orbits has proved a powerful method, however knot theory can only be applied to three-dimensional systems. Still, the core principles upon…
We construct cobordisms of small genus between torus knots and use them to determine the cobordism distance between torus knots of small braid index. In fact, the cobordisms we construct arise as the intersection of a smooth algebraic curve…
Proteins are linear molecular chains that often fold to function. The topology of folding is widely believed to define its properties and function, and knot theory has been applied to study protein structure and its implications. More that…
Proteins form a very important class of polymers. In spite of major advances in the understanding of polymer science, the protein problem has remained largely unsolved. Here, we show that a polymer chain viewed as a tube not only captures…
We prove that the topological locally flat slice genus of large torus knots takes up less than three quarters of the ordinary genus. As an application, we derive the best possible linear estimate of the topological slice genus for torus…
Hopfions, as three-dimensional topologically nontrivial structures described by poloidal and toroidal winding numbers, hold promise as robust information carriers in spintronics, functional materials, and optical communications. Although…
We establish upper bounds for the complexity of Seifert fibered manifolds with nonempty boundary. In particular, we obtain potentially sharp bounds on the complexity of torus knot complements.
Knots are commonly represented and manipulated via diagrams, which are decorated planar graphs. When such a knot diagram has low treewidth, parameterized graph algorithms can be leveraged to ensure the fast computation of many invariants…