Related papers: Characteristic length of random knotting for cylin…
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…
It is nontrivial whether the average size of a ring polymer should become smaller or larger under a topological constraint. Making use of some knot invariants, we evaluate numerically the mean square radius of gyration for ring polymers…
We have developed a parallel algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 110. We have also extended the series for the first 10 area-weighted moments and the radius of…
Scaling arguments are used to analyze the size of topologically constrained closed ring polymer with excluded volume. It is found that there exists a finite range of polymer thickness (excluded volume) in which self-avoidance is unimportant…
Anomalously strong finite-size effects have been observed for the mean square radius of gyration $R^2_K$ of Gaussian random polygons with a fixed knot $K$ as a function of the number $N$ of polygonal nodes. Through computer simulations with…
This paper derives the exact cumulative density function of the distance between a randomly located node and any arbitrary reference point inside a regular $\el$-sided polygon. Using this result, we obtain the closed-form probability…
In this paper we examine the relative knotting probabilities in a lattice model of ring polymers confined in a cavity. The model is of a lattice knot of size $n$ in the cubic lattice, confined to a cube of side-length $L$ and with volume…
We calculate the mean end-to-end distance ($R$) of a self-avoiding polymer encapsulated in an infinitely long cylinder with radius $D$. A self-consistent perturbation theory is used to calculate $R$ as a function of $D$ for impenetrable…
We present an algorithm for sampling tightly confined random equilateral closed polygons in three-space which has runtime linear in the number of edges. Using symplectic geometry, sampling such polygons reduces to sampling a moment…
The first algorithm for sampling the space of thick equilateral knots, as a function of thickness, will be described. This algorithm is based on previous algorithms of applying random reflections. To prove the existence of the algorithm, we…
We consider polymers in which M randomly selected pairs of monomers are restricted to be in contact. Analytical arguments and numerical simulations show that an ideal (Gaussian) chain of N monomers remains expanded as long as M<<N; its mean…
It has been known that the distribution of the random distances between two uniformly distributed points within a convex polygon can be obtained based on its chord length distribution (CLD). In this report, we first verify the existing…
A self-avoiding polygon is a lattice polygon consisting of a closed self-avoiding walk on a square lattice. Surprisingly little is known rigorously about the enumeration of self-avoiding polygons, although there are numerous conjectures…
The statistical mechanics of a long knotted collapsed polymer is determined by a free-energy with a knot-dependent subleading term, which is linked to the length of the shortest polymer that can hold such knot. The only other parameter…
Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…
We examine numerically the distribution function $f_K(r)$ of distance $r$ between opposite polygonal nodes for random polygons of $N$ nodes with a fixed knot type $K$. Here we consider three knots such as $\emptyset$, $3_1$ and $3_1 \sharp…
We describe a new algorithm, the reflection method, to generate off-lattice random walks of specified, though arbitrarily large, thickness in $\mathbb{R}^3$ and prove that our method is ergodic on the space of thick walks. The data…
Numerical studies of the average size of trivially knotted polymer loops with no excluded volume are undertaken. Topology is identified by Alexander and Vassiliev degree 2 invariants. Probability of a trivial knot, average gyration radius,…
We report extensive simulations of the relaxation dynamics of a self-avoiding polymer confined inside a cylindrical pore. In particular, we concentrate on examining how confinement influences the scaling behavior of the global relaxation…
A gas of self-avoiding surfaces with an arbitrary polynomial coupling to the gaussian curvature and an extrinsic curvature term can be realized in a three-dimensional Ising bcc lattice with only three local couplings. Similar three…