Related papers: Characteristic length of random knotting for cylin…
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…
In this paper we deal with the classical problem of random cover times. We investigate the distribution of the time it takes for a Poisson process of cylinders to cover a set $A \subset \mathbb{R}^d.$ This Poisson process of cylinders is…
We study the formation of knots on a macroscopic ball-chain, which is shaken on a horizontal plate at 12 times the acceleration of gravity. We find that above a certain critical length, the knotting probability is independent of chain…
We consider the expected value for the total curvature of a random closed polygon. Numerical experiments have suggested that as the number of edges becomes large, the difference between the expected total curvature of a random closed…
We investigate the probability for appearance of knots in self-avoiding loops (SALs) on a cubic lattice. A set of N-step loops is generated by attempting to combine pairs of (N/2)-step self-avoiding walks constructed by a dimerization…
For a polygonal knot K, it is shown that a tube of radius R(K), the polygonal thickness radius, is an embedded torus. Given a thick configuration K, perturbations of size r<R(K) define satellite structures, or local knotting. We explore…
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…
A classical knot is described by a one-stroke trajectory with entanglements of a string. The replica method appears as a powerful tool in statistical mechanics for a polymer or self-avoiding walk. We consider this replica N to 0 limit in…
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…
We study the dynamics of a knot in a semiflexible polymer confined to a narrow channel of width comparable to the polymers' persistence length. Using a combination of Brownian dynamics simulations and a coarse-grained stochastic model, we…
We study random surfaces constructed by glueing together $N/k$ filled $k$-gons along their edges, with all $(N-1)!! = (N-1)(N-3)...3\cdot 1$ pairings of the edges being equally likely. (We assume that lcm $\{2,k\}$ divides $N$.) The Euler…
These lectures deal with: (1) a brief review of the theory of flexible random manifolds (with fixed intrinsic metric), connected to the physics of polymerized membranes, and of the effect of extrinsic curvature (crumpling transitions); (2)…
We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40…
The conformations of interacting linear polymers on a dynamical planar random lattice are studied using a random two-matrix model. An exact expression for the partition function of self-avoiding chains subject to attractive contact…
Random walks and polygons are used to model polymers. In this paper we consider the extension of writhe, self-linking number and linking number to open chains. We then study the average writhe, self-linking and linking number of random…
A polynomial lemniscate is a curve in the complex plane defined by $\{z \in \mathbb{C}:|p(z)|=t\}$. Erd\"os, Herzog, and Piranian posed the extremal problem of determining the maximum length of a lemniscate $\Lambda=\{ z \in…
We discuss the scattering function of a Gaussian random polygon with N nodes under a given topological constraint through simulation. We obtain the Kratky plot of a Gaussian polygon of N=200 having a fixed knot for some different knots such…
We analyse new exact enumeration data for self-avoiding polygons, counted by perimeter and area on the square, triangular and hexagonal lattices. In extending earlier analyses, we focus on the perimeter moments in the vicinity of the…
Self-avoiding polymers in strictly two-dimensional ($d=2$) melts are investigated by means of molecular dynamics simulation of a standard bead-spring model with chain lengths ranging up to N=2048. % The chains adopt compact configurations…
We present new computations of approximately length-minimizing polygons with fixed thickness. These curves model the centerlines of "tight" knotted tubes with minimal length and fixed circular cross-section. Our curves approximately…