Entanglement complexity of lattice ribbons
From MaRDI portal
Publication:1285248
DOI10.1007/BF02175557zbMath0916.57014OpenAlexW2056687992MaRDI QIDQ1285248
E. J. Janse van Rensburg, Stuart G. Whittington, Maria Carla Tesi, De Witt Sumners, Enzo Orlandini
Publication date: 19 July 1999
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02175557
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
A random walk with Stu Whittington ⋮ Phase diagram of twist storing lattice polymers in variable solvent quality ⋮ KNOTS, SLIPKNOTS, AND EPHEMERAL KNOTS IN RANDOM WALKS AND EQUILATERAL POLYGONS ⋮ Generalizing ribbons and the twist of the lattice ribbon ⋮ Statistical topology of closed curves: Some applications in polymer physics ⋮ Mean unknotting times of random knots and embeddings ⋮ A pattern theorem for lattice clusters ⋮ Thermodynamic and topological properties of copolymer rings with a segregation/mixing transition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Monte Carlo algorithm for lattice ribbons.
- Knoten und Vollringe
- Knots in self-avoiding walks
- Entanglement complexity of graphs in Z3
- The writhe of a self-avoiding polygon
- Self-Linking and the Gauss Integral in Higher Dimensions
- On the Number of Self-Avoiding Walks
- FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE
- Knots
This page was built for publication: Entanglement complexity of lattice ribbons