Related papers: Average size of random polygons with fixed knot to…
We present computer simulations to examine probability distributions of gyration radius for the no-thickness closed polymers of N straight segments of equal length. We are particularly interested in the conditional distributions when 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 consider random rectangles in $\mathbb{R}^2$ that are distributed according to a Poisson random measure, i.e., independently and uniformly scattered in the plane. The distributions of the length and the width of the rectangles are…
We find a power law for the number of knot-monomers with an exponent $0.39 \pm0.13$ in agreement with previous simulations. For the average size of a knot we also obtain a power law $N_m=2.56\cdot N^{0.20\pm0.04}$. We further present data…
In thermally fluctuating long linear polymeric chain in solution, the ends come from time to time into a direct contact or a close vicinity of each other. At such an instance, the chain can be regarded as a closed one and thus will form a…
We study the probability distribution of the area and the number of vertices of random polygons in a convex set $K\subset\mathbb{R}^2$. The novel aspect of our approach is that it yields uniform estimates for all convex sets…
One measure of geometrical complexity of a spatial curve is the number of crossings in a planar projection of the curve. For $N$-noded ring polymers with a fixed knot type, we evaluate numerically the average of the crossing number over…
By performing Monte Carlo sampling of $N$-steps self-avoiding polygons embedded on different Bravais lattices we explore the robustness of universality in the entropic, metric and geometrical properties of knotted polymer rings. In…
A physical interpretation of the rope simulated by the SONO algorithm is presented. Properties of the tight polygonal knots delivered by the algorithm are analyzed. An algorithm for bounding the ropelength of a smooth inscribed knot is…
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…
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…
We perform Transition matrix Monte Carlo simulations to evaluate the entropy of rhombus tilings with fixed polygonal boundaries and 2D-fold rotational symmetry. We estimate the large-size limit of this entropy for D=4 to 10. We confirm…
The thickness, NIR(K) of a knot or link K is defined to be the radius of the largest solid tube one can put around the curve without any self intersections, which is also known as the normal injectivity radius of K. For C^{1,1} curves K,…
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…
The random polytope $K_n$, defined as the convex hull of $n$ points chosen uniformly at random on the boundary of a smooth convex body, is considered. Proofs for lower and upper variance bounds, strong laws of large numbers and central…
Unconcatenated, unknotted polymer rings in the melt are subject to strong interactions with neighboring chains due to the presence of topological constraints. We study this by computer simulation using the bond-fluctuation algorithm for…
For a given convex body K in $R^d$, a random polytope $K^{(n)}$ is defined (essentially) as the intersection of $n$ independent closed halfspaces containing $K$ and having an isotropic and (in a specified sense) uniform distribution. We…
While there is extensive literature on approximation, deterministic as well as random, of general convex bodies $K$ in the symmetric difference metric, or other metrics arising from intrinsic volumes, very little is known for corresponding…
We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…
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…