Bounds on multiple self-avoiding polygons

DOI10.4153/CMB-2017-072-XMaRDI QIDQ4684449zbMATH OpenFDO

Authors Kyungpyo Hong, Seungsang Oh

Publication date 28 September 2018

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1806.09717

zbMATH Keywords

ring polymerself-avoiding polygon

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Statistical mechanics of polymers (82D60)

Abstract: A self-avoiding polygon is a lattice polygon consisting of a closed self-avoiding walk on a square lattice. Surprisingly little is known rigorously about the enumeration of self-avoiding polygons, although there are numerous conjectures that are believed to be true and strongly supported by numerical simulations. As an analogous problem of this study, we consider multiple self-avoiding polygons in a confined region, as a model for multiple ring polymers in physics. We find rigorous lower and upper bounds of the number $p_{mimesn}$ of distinct multiple self-avoiding polygons in the $mimesn$ rectangular grid on the square lattice. For $m=2$, $p_{2imesn}=2^{n-1}-1$. And, for integers $m,ngeq3$, ${\displaystyle }$2^{m+n-3} left(frac{17}{10} ight)^{(m-2)(n-2)} leq p_{m imes n} leq 2^{m+n-3} left(frac{31}{16} ight)^{(m-2)(n-2)}.${\displaystyle }$

Recommendations

• Lattice Polygons and Related Objects
• Self-avoiding walks and polygons confined to a square
• On fully extended self-avoiding polygons
• Contacts in self-avoiding walks and polygons
• An upper bound on the number of self-avoiding polygons via joining

Cited in

(5)

• On fully extended self-avoiding polygons
• Growth rate of quantum knot mosaics
• Self-averaging in random self-interacting polygons
• Self-avoiding walks and polygons confined to a square
• Quantum knot mosaics and bounds of the growth constant

This page was built for publication: Bounds on multiple self-avoiding polygons

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