Related papers: The entropic cost to tie a knot
This paper contains the first knot polynomials which can distinguish the orientations of classical knots and which make no excplicit use of the knot group. But they make extensive use of the meridian and of the longitude in a geometric way.…
In this paper we study how randomly generated knots occupy a volume of space using topological methods. To this end, we consider the evolution of the first homology of an immersed metric neighbourhood of a knot's embedding for growing…
Knots are entangled structures that cannot be untangled without a cut. Topological stability of knots is one of the many examples of their important properties that can be used in information storage and transfer. Knot dynamics is important…
Let $p_n$ denote the number of self-avoiding polygons of length $n$ on a regular three-dimensional lattice, and let $p_n(K)$ be the number which have knot type $K$. The probability that a random polygon of length $n$ has knot type $K$ is…
We introduce a two-dimensional lattice model for the description of knotted polymer rings. A polymer configuration is modeled by a closed polygon drawn on the square diagonal lattice, with possible crossings describing pairs of strands of…
We study the problem of partitioning a given simple polygon $P$ into a minimum number of connected polygonal pieces, each of bounded size. We describe a general technique for constructing such partitions that works for several notions of…
We compute the entropy of entanglement in the ground states of a general class of quantum spin-chain Hamiltonians - those that are related to quadratic forms of Fermi operators - between the first N spins and the rest of the system in the…
The space of n-sided polygons embedded in three-space consists of a smooth manifold in which points correspond to piecewise linear or ``geometric'' knots, while paths correspond to isotopies which preserve the geometric structure of these…
We consider the ways minimal sets of flows in $S^3$ may be embedded. We prove that given any $C^2$ flow on $S^3$ with positive entropy, there is an uncountable collection $\mathcal{M}$ of topologically distinct minimal sets such that for…
For a positive integer $n\ge 3$, the collection of $n$-sided polygons embedded in $3$-space defines the space of geometric knots. We will consider the subspace of equilateral knots, consisting of embedded $n$-sided polygons with unit length…
A minimal knot is the intersection of a topologically embedded branched minimal disk in $\mathbb{R}^4$ $\mathbb{C}^2 $ with a small sphere centered at the branch point. When the lowest order terms in each coordinate component of the…
The topological effects on the thermal properties of several knot configurations are investigated using Monte Carlo simulations. In order to check if the topology of the knots is preserved during the thermal fluctuations we propose a method…
Semiflexible polymer models are widely used as a paradigm to understand structural phases in biomolecules including folding of proteins. Since stable knots are not so common in real proteins, the existence of stable knots in semiflexible…
The evaluation of partition functions is a central problem in statistical physics. For lattice systems and other discrete models the partition function may be expressed as the contraction of a tensor network. Unfortunately computing such…
The lectures review the state of affairs in modern branch of mathematical physics called probabilistic topology. In particular we consider the following problems: (i) We estimate the probability of a trivial knot formation on the lattice…
We study by Monte Carlo simulations a model of knotted polymer ring adsorbing onto an impenetrable, attractive wall. The polymer is described by a self-avoiding polygon (SAP) on the cubic lattice. We find that the adsorption transition…
Although the homotopy-knot theory has been utilized to implement effective topological classification for non-Hermitian systems, the physical implications underlying distinct knot topologies remain ambiguous and are rarely addressed. In…
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…
This paper details a series of experiments in searching for minimal energy configurations for knots and links using the computer program KnotPlot. The most interesting phenomena found in these experiments is the dependence of the…
We produce embeddings of knots in thin position that admit compressible thin levels. We also find the bridge number of tangle sums where each tangle is high distance.