Related papers: To knot or not to knot
Using a lattice model of polymers in a tube, we define one way to characterise different configurations of a given knot as either "local" or "non-local" and, for several ring polymer models, we provide both theoretical and numerical…
We report on a computational study of the statics and dynamics of long flexible linear polymers that spontaneously knot and unknot. Specifically, the equilibrium self-entanglement properties, such as the knotting probability, knot length…
We construct an infinite collection of knots with the property that any knot in this family has $n$-string essential tangle decompositions for arbitrarily high $n$.
Spontaneous formation of knots in long polymers at equilibrium is inevitable but becomes rare in sufficiently short chains. Here, we show that knotting and knot complexity increase by orders of magnitude in diblock polymers with a fraction…
We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, {\sc…
It has been suggested recently that knots might exist as stable soliton solutions in a simple three-dimensional classical field theory, opening up a wide range of possible applications in physics and beyond. We have re-examined and extended…
A time crystal is a time dependent physical system that does not reach a standstill, even in state of minimum energy. Here we show that the stability of a time crystal can be enhanced by its topology. For this we simulate time crystals made…
We construct families of trivial $2$-knots $K_i$ in $\mathbb{R}^4$ such that the maximal complexity of $2$-knots in any isotopy connecting $K_i$ with the standard unknot grows faster than a tower of exponentials of any fixed height of the…
An analysis of extensive simulations of interacting self-avoiding polygons on cubic lattice shows that the frequencies of different knots realized in a random, collapsed polymer ring decrease as a negative power of the ranking order, and…
We discuss the possibility of the existence of finite algorithms that may give distinct knot classes. In particular we present two attempts for such algorithms which seem promising, one based on knot projections on a plane, the other on…
Knots are abundant in globular homopolymers but rare in globular proteins. To shed new light on this long-standing conundrum, we study the influence of sequence on the formation of knots in proteins under native conditions within the…
The height of a knotoid is a measure of how far it is from being a knot. Here we define the positive and negative parts of the height, and we prove that they determine the unsigned height. Some polynomial invariants provide lower bounds for…
We define a notion of complexity for shake-slice knots which is analogous to the definition of complexity for h-cobordisms studied by Morgan-Szab\'o. We prove that for each framing $n \ne 0$ and complexity $c \ge 0$, there is an…
We determine the probability distribution of the breaking strength for chains of N links, which have been produced by repeatedly breaking a very long chain.
Knot theory is the Mathematical study of knots. In this paper we have studied the Composition of two knots. Knot theory belongs to Mathematical field of Topology, where the topological concepts such as topological spaces, homeomorphisms,…
We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison…
The entropic pressure in the vicinity of a cubic lattice knot is examined as a model of the entropic pressure near a knotted ring polymer in a good solvent. A model for the scaling of the pressure is developed and this is tested numerically…
The goal of this paper is to discuss the possibility of finding an algorithm that can give all distinct knots up to a desired complexity. Two such algorithms are presented, one based on projections on a plane, the other on closed…
We present four models for a random graph and show that, in each case, the probability that a graph is intrinsically knotted goes to one as the number of vertices increases. We also argue that, for $k \geq 18$, most graphs of order $k$ are…
We give statistical definitions of the length, l, of a loose prime knot tied into a long, fluctuating ring macromolecule. Monte Carlo results for the equilibrium, good solvent regime show that < l > ~ N^t, where N is the ring length and t ~…