Improved lower bounds on the connective constants for two-dimensional self-avoiding walks

DOI10.1088/0305-4470/37/48/001zbMATH Open1063.82014arXivcond-mat/0409381OpenAlexW3105783798MaRDI QIDQ4660428FDOQ4660428

Authors: I. Jensen 

Publication date: 21 March 2005

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

Abstract: We calculate improved lower bounds for the connective constants for self-avoiding walks on the square, hexagonal, triangular, $(4.8^2)$, and $(3.12^2)$ lattices. The bound is found by Kesten's method of irreducible bridges. This involves using transfer-matrix techniques to exactly enumerate the number of bridges of a given span to very many steps. Upper bounds are obtained from recent exact enumeration data for the number of self-avoiding walks and compared to current best available upper bounds from other methods.

Full work available at URL: https://arxiv.org/abs/cond-mat/0409381

Recommendations

• Lower bound on the connective constant for square lattice self-avoiding walks
• Bounds for the connective constant of the hexagonal lattice
• New lower bounds on the self-avoiding-walk connective constant
• Upper Bounds for the Connective Constant of Self-Avoiding Walks
• Upper bounds for the connective constant in \(\mathbb Z^d\)

Mathematics Subject Classification ID

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

Cited In (11)

• Bounds on connective constants of regular graphs
• New lower bounds on the self-avoiding-walk connective constant
• Upper Bounds for the Connective Constant of Self-Avoiding Walks
• Bounds for the connective constant of the hexagonal lattice
• Weakly directed self-avoiding walks
• Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion
• Upper and lower bounds for the connective constants of self-avoiding walks on the Archimedean and Laves lattices
• Entanglement percolation and spheres in \(\mathbb{Z}^d\)
• Self-avoiding walks and connective constants
• The Hammersley-Welsh bound for self-avoiding walk revisited
• Degenerate random environments

This page was built for publication: Improved lower bounds on the connective constants for two-dimensional self-avoiding walks

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