Lower bound for the connective constant of a self-avoiding walk on a square lattice

DOI10.1016/0097-3165(72)90024-6MaRDI QIDQ2556409zbMATH OpenOpenAlexFDO

Authors William A. Beyer, M. B. Wells

Publication date 1972

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(72)90024-6

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Cites work

• A Study of the Restricted Random Walk
• scientific article; zbMATH DE number 3388544 (Why is no real title available?)
• On the Number of Self-Avoiding Walks

Cited in

(4)

• Entanglement percolation and spheres in \(\mathbb{Z}^d\)
• Upper Bounds for the Connective Constant of Self-Avoiding Walks
• Sequential stratified splitting for efficient Monte Carlo integration
• Upper bounds for the connective constant of weighted self-avoiding walks

This page was built for publication: Lower bound for the connective constant of a self-avoiding walk on a square lattice

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