Asymptotics of linked polygons

DOI10.1088/1751-8121/ABA8CFMaRDI QIDQ5870670zbMATH OpenOpenAlexFDO

Authors Anthony Bonato, E. Orlandini, S. G. Whittington

Publication date 23 January 2023

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/aba8cf

zbMATH Keywords

Monte Carlo methodslinkslattice polygons

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX) Quantum theory (81-XX)

Recommendations

• Asymptotics of multicomponent linked polygons
• Linking and link complexity of geometrically constrained pairs of rings
• Asymptotics of knotted lattice polygons
• scientific article; zbMATH DE number 219014
• Random linking of lattice polygons

Cites work

• scientific article; zbMATH DE number 3530652 (Why is no real title available?)
• scientific article; zbMATH DE number 1218943 (Why is no real title available?)
• scientific article; zbMATH DE number 201032 (Why is no real title available?)
• scientific article; zbMATH DE number 3198429 (Why is no real title available?)
• Asymptotics of knotted lattice polygons
• Critical exponents of theN-vector model
• Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks.
• Entanglement complexity of graphs in Z³
• Entropic exponents of lattice polygons with specified knot type
• Knots in random walks
• Knots in self-avoiding walks
• LINKING OF RANDOM p-SPHERES IN Z^d
• Linking numbers of closed manifolds at random in \(\mathbb{R}^n\), inductances and contacts
• Linking of uniform random polygons in confined spaces
• Linking probabilities of off-lattice self-avoiding polygons and the effects of excluded volume
• Monte Carlo results for projected self-avoiding polygons: a two-dimensional model for knotted polymers
• Monte Carlo study of the interacting self-avoiding walk model in three dimensions.
• On the topology of a polymer ring
• On the universality of knot probability ratios
• Random linking of lattice polygons
• Rigid curves at random positions and linking numbers
• The BFACF algorithm and knotted polygons
• The linking probability for 2-component links which span a lattice tube
• UPPER BOUNDS ON LINKING NUMBERS OF THICK LINKS
• What is the length of a knot in a polymer?

Cited in

(6)

• Asymptotics of multicomponent linked polygons
• Asymptotic behavior of the shape of planar polygons by linear flows
• Settling the bound on the rectilinear link radius of a simple rectilinear polygon
• The unusual asymptotics of three-sided prudent polygons
• Linking and link complexity of geometrically constrained pairs of rings
• Connecting polygonizations via stretches and twangs

This page was built for publication: Asymptotics of linked polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5870670)