Linking and link complexity of geometrically constrained pairs of rings

DOI10.1088/1751-8121/AC385AOpenAlexW3213783682MaRDI QIDQ5051669

Enzo Orlandini, Maria Carla Tesi, Stuart G. Whittington

Publication date: 18 November 2022

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1751-8121/ac385a

zbMATH Keywords

Monte Carlo methodslattice polygonstopological links

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Related Items (1)

Thermodynamic and topological properties of copolymer rings with a segregation/mixing transition

Cites Work

• Unnamed Item
• Unnamed Item
• Monte Carlo study of the interacting self-avoiding walk model in three dimensions.
• The knot spectrum of confined random equilateral polygons
• On the Alexander polynomial
• The linking number and the writhe of uniform random walks and polygons in confined spaces
• Linking of uniform random polygons in confined spaces
• Linking probabilities of off-lattice self-avoiding polygons and the effects of excluded volume
• Asymptotics of knotted lattice polygons
• The BFACF algorithm and knotted polygons
• LINKING OF RANDOM p-SPHERES IN Z^d
• The dimensions of knotted polygons
• Random linking of lattice polygons
• THE LINKING PROBABILITY FOR 2-COMPONENT LINKS WHICH SPAN A LATTICE TUBE
• Asymptotics of linked polygons
• Knotting spectrum of polygonal knots in extreme confinement

This page was built for publication: Linking and link complexity of geometrically constrained pairs of rings