Characteristic length of random knotting for cylindrical self-avoiding polygons
نویسندگان
چکیده
منابع مشابه
Characteristic length of random knotting for cylindrical self-avoiding polygons
We discuss the probability of random knotting for a model of self-avoiding polygons whose segments are given by cylinders of unit length with radius r. We show numerically that the characteristic length of random knotting is roughly approximated by an exponential function of the chain thickness r. keyword characteristic length, random knotting, self-avoiding polygons, knot invariants,knots PACS...
متن کاملScaling function for self-avoiding polygons
Exactly solvable models of planar polygons, weighted by perimeter and area, have deepened our understanding of the critical behaviour of polygon models in recent years. Based on these results, we derive a conjecture for the exact form of the critical scaling function for planar self-avoiding polygons. The validity of this conjecture was recently tested numerically using exact enumeration data f...
متن کاملScaling prediction for self-avoiding polygons revisited
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 bicritical point. We also consider the shape of the critical curve near the bicritical point, which describes the crossover to the branched polymer phase. Our rece...
متن کاملCompressed self-avoiding walks, bridges and polygons
We study various self-avoiding walks (SAWs) which are constrained to lie in the upper half-plane and are subjected to a compressive force. This force is applied to the vertex or vertices of the walk located at the maximum distance above the boundary of the half-space. In the case of bridges, this is the unique end-point. In the case of SAWs or self-avoiding polygons, this corresponds to all ver...
متن کاملOn fully extended self-avoiding polygons
The paper gives recurrence relations on the number of 2n step fully extended (i.e., full-dimensional) self-avoiding polygons in n-and (n-1)-dimensional integer lattices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters A
سال: 2000
ISSN: 0375-9601
DOI: 10.1016/s0375-9601(00)00545-4