Related papers: To knot or not to knot
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…
We review the polynomial parameterization of classical knots and prove the analogous results for long $2$ knots. We also construct polynomial parameterizations for certain classes of knotted spheres (such as spun and twist spun of the…
We examine computer experiments that can be performed to understand the dynamics of knots under self-repulsion. In the course of specific computer exploration we use the knot theory of rational knots and rational tangles to produce classes…
We explore free knot diagrams, which are projections of knots into the plane which don't record over/under data at crossings. We consider the combinatorial question of which free knot diagrams give which knots and with what probability.…
We consider the space of all smooth knots in the 3-sphere isotopic to a given knot, with the aim of finding a small subspace onto which this large space deformation retracts. For torus knots and many hyperbolic knots we show the subspace…
In this paper, we introduce a new type of relation between knots called the descendant relation. One knot $H$ is a descendant of another knot $K$ if $H$ can be obtained from a minimal crossing diagram of $K$ by some number of crossing…
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 use the Chebyshev knot diagram model of Koseleff and Pecker in order to introduce a random knot diagram model by assigning the crossings to be positive or negative uniformly at random. We give a formula for the probability of choosing a…
A knot theory for two-dimensional square lattice is proposed, which sheds light on design of new two-dimensional material with high topological numbers. We consider a two-band model, focusing on the Hall conductance {\sigma}xy = e^2/hbar*P,…
We develop a theoretical description of the topological disentanglement occurring when torus knots reach the ends of a semi-flexible polymer under tension. These include decays into simpler knots and total unknotting. The minimal number of…
When a falling chain strikes a surface, it can accelerate downwards faster than free-fall. This counterintuitive effect occurs when a tension is created in the chain above where it strikes the surface. The size of this tension, and how it…
The chain fountain is an entertaining, counter-intuitive phenomenon. When a chain flows up over the edge of a container and then falls to the ground below, it is observed that the top of the chain rises up above the containers edge. Here…
We study the interplay between entropy and topological constraints for a polymer chain in which sliding rings (slip-links) enforce pair contacts between monomers. These slip-links divide a closed ring polymer into a number of sub-loops…
Considering a Markov chain defined on a cycle, near-quadratic improvement of mixing is shown when only a subtle perturbation is introduced to the structure and non-reversible transition probabilities are used. More precisely, a mixing time…
A {\it stuck knot} is a knot diagram containing designated crossings, called {\it stuck crossings}, whose incident strands are required to remain locally non-separable. These rigidity constraints restrict the allowable ambient isotopies and…
The transient number of a knot K, denoted tr(K), is the minimal number of simple arcs that have to be attached to K, in order that K can be homotoped to a trivial knot in a regular neighborhood of the union of K and the arcs. We give a…
Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…
We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an…
A popular question in Bernoulli percolation models is if the probability of connection between two vertices in a transitive graph decays monotonically with the distance between these two vertices. For example, on the square lattice is an…
The untwisting number of a knot K is the minimum number of null-homologous twists required to convert K to the unknot. Such a twist can be viewed as a generalization of a crossing change, since a classical crossing change can be effected by…