The knot probability in lattice polygons

The incidence of knots in lattice polygons in the face-centred cubic lattice is investigated numerically. The authors generate a sample of polygons using a pivot algorithm and detect knotted polygons by calculating the Alexander polynomial. If p0n( phi ) is the probability that the polygon with n edges is the unknot, then it is known that lim supn to infinity p0n( phi )1n/=e- varies as (0)<1. They find that varies as ( phi )=(7.6+or-0.9)*10-6. The effect of the solvent quality on p0n( phi ) is considered. The data show that the probability of a polygon being knotted increases rapidly as the quality of the solvent deteriorates.

[1]  Alon Orlitsky,et al.  Self-avoiding random loops , 1988, IEEE Trans. Inf. Theory.

[2]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[3]  S. Edwards.  Statistical mechanics with topological constraints: I , 1967 .

[4]  Harry Kesten,et al.  On the Number of Self‐Avoiding Walks , 1963 .

[5]  D. Sumners,et al.  The growth of the number of prime knots , 1987, Mathematical Proceedings of the Cambridge Philosophical Society.

[6]  J. Hammersley.  The number of polygons on a lattice , 1961, Mathematical Proceedings of the Cambridge Philosophical Society.

[7]  C. H. Dowker,et al.  Classification of knot projections , 1983 .

[8]  F. McCrackin,et al.  Monte Carlo Studies of Self-Interacting Polymer Chains with Excluded Volume. I. Squared Radii of Gyration and Mean-Square End-to-End Distances and Their Moments , 1973 .

[9]  N. Cozzarelli,et al.  Biochemical topology: applications to DNA recombination and replication. , 1986, Science.

[10]  N R Cozzarelli,et al.  Discovery of a predicted DNA knot substantiates a model for site-specific recombination. , 1985, Science.

[11]  S. Whittington,et al.  Knots in self-avoiding walks , 1988 .

[12]  S. Edwards.  Statistical mechanics with topological constraints: II , 1968 .

[13]  S. Whittington,et al.  The pivot algorithm and polygons: results on the FCC lattice , 1990 .

[14]  Morris W. Hirsch,et al.  Topology of 3-Manifolds and Related Topics. , 1964 .

[15]  D. W. Sumners,et al.  The knot theory of molecules , 1987 .

[16]  Nicholas Pippenger,et al.  Knots in random walks , 1989, Discret. Appl. Math..

[17]  C. Yang,et al.  Braid Group Knot Theory and Statistical Mechanics , 1989 .

[18]  H. Zoladek.  One-dimensional random walk with self-interaction , 1987 .

[19]  H. Kesten,et al.  ON THE NUMBER OF SELF-AVOIDING WALKS. PART II , 1964 .

[20]  F. W. Wiegel,et al.  On the topology of a polymer ring , 1986, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[21]  D. C. Rapaport,et al.  Configurational properties of polymers in a good solvent , 1976 .

[22]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[23]  Alon Orlitsky,et al.  Monte Carlo generation of self-avoiding walks with fixed endpoints and fixed length , 1990 .

[24]  A. V. Lukashin,et al.  Statistical mechanics and topology of polymer chains , 1975, Nature.

[25]  M. Sykes,et al.  Probability of Initial Ring Closure for Self‐Avoiding Walks on the Face‐Centered Cubic and Triangular Lattices , 1967 .

[26]  W. Kendall.  The Knotting of Brownian Motion in 3-Space , 1979 .