Entanglement complexity of self-avoiding walks
- 21 December 1992
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 25 (24) , 6557-6566
- https://doi.org/10.1088/0305-4470/25/24/010
Abstract
Self-avoiding walks on three-dimensional lattices are flexible linear objects which can be self-entangled. The authors discuss several ways to measure entanglement complexity for n-step walks, and prove that these complexity measures tend to infinity with n. For small n, they use Monte Carlo methods to estimate and compare the n-dependence of two of these complexity measures.Keywords
This publication has 19 references indexed in Scilit:
- Divergence-Free Fields: Energy and Asymptotic Crossing NumberAnnals of Mathematics, 1991
- The knot probability in lattice polygonsJournal of Physics A: General Physics, 1990
- A note on topology and magnetic energy in incompressible perfectly conducting fluidsJournal of Fluid Mechanics, 1988
- Tight knotsMacromolecules, 1984
- The Knotting of Brownian Motion in 3-SpaceJournal of the London Mathematical Society, 1979
- Critical Behavior in Percolation ProcessesPhysical Review B, 1970
- Statistical mechanics with topological constraints: IProceedings of the Physical Society, 1967
- FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICEThe Quarterly Journal of Mathematics, 1962
- Chemical Topology1Journal of the American Chemical Society, 1961
- The number of polygons on a latticeMathematical Proceedings of the Cambridge Philosophical Society, 1961