Related papers: Knotting statistics for polygons in lattice tubes
We study the statistics of branching polymers with excluded-volume interactions, by modeling them as single self-avoiding trees on a generic regular periodic lattice with coordination number $q$. Each lattice site can be occupied at most by…
Several nontrivial properties are shown for the mean square radius of gyration $R_K^2$ of ring polymers with a fixed knot type K. Through computer simulation, we discuss both finite-size and asymptotic behaviors of the gyration radius under…
We have evaluated by numerical simulation the average size $R_K$ of random polygons of fixed knot topology $K = \emptyset, 3_1, 3_1\sharp4_1$, and we have confirmed the scaling law $R^2_K \sim N^{2\nu_K}$ for the number $N$ of polygonal…
Using canonical Monte Carlo simulations, we introduce a new numerical procedure for comparing the entropic exponents of polymers with different constraints and/or topologies. Setting up competitions between polymer segments which can…
The statistical properties of random lattice knots, the topology of which is determined by the algebraic topological Jones-Kauffman invariants was studied by analytical and numerical methods. The Kauffman polynomial invariant of a random…
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…
In this paper the number and lengths of minimal length lattice knots confined to slabs of width $L$, is determined. Our data on minimal length verify the results by Sharein et.al. (2011) for the similar problem, expect in a single case,…
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.…
A numerical simulation shows that the osmotic pressure of compressed lattice knots is a function of knot type, and so of entanglements. The osmotic pressure for the unknot goes through a negative minimum at low concentrations, but in the…
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…
Let $M_n$ be the topological moduli space of all parallel n-cables of long framed oriented knots in 3-space. We construct in a combinatorial way for each natural number $n>1$ a 1-cocycle $R_n$ which represents a non trivial class in…
In this work the thermodynamic properties of short polymer knots (up to 120 segments) defined on a simple cubic lattice are studied with the help of the Wang-Landau Monte Carlo algorithm. The sampling process is performed using pivot…
Through extensive numerical simulations we investigate the evolution of knotted and linked vortices in the FitzHugh-Nagumo model. On medium time scales, of the order of a hundred times the vortex rotation period, knots simultaneously…
The mechanical properties of polymer knots under stretching in a bad or good solvent are investigated by applying a given force $F$ to a point of the knot while keeping another point fixed. The Monte Carlo sampling of the polymer…
Stochastic simulations are used to characterize the knotting distributions of random ring polymers confined in spheres of various radii. The approach is based on the use of multiple Markov chains and reweighting techniques, combined with…
We study random knotting by considering knot and link diagrams as decorated, (rooted) topological maps on spheres and pulling them uniformly from among sets of a given number of vertices $n$, as first established in recent work with…
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 have developed an improved algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 90. Analysis of the resulting series yields very accurate estimates of the connective…
An implementation of BFACF-style algorithms on knotted polygons in the simple cubic, face centered cubic and body centered cubic lattice is used to estimate the statistics and writhe of minimal length knotted polygons in each of the…
The study of knots and links from a probabilistic viewpoint provides insight into the behavior of "typical" knots, and opens avenues for new constructions of knots and other topological objects with interesting properties. The knotting of…