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

DOI10.1016/0097-3165(72)90024-6zbMath0248.05007OpenAlexW1981186064MaRDI QIDQ2556409

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)

Related Items

Upper Bounds for the Connective Constant of Self-Avoiding Walks ⋮ Entanglement percolation and spheres in \(\mathbb{Z}^d\) ⋮ Sequential stratified splitting for efficient Monte Carlo integration

Cites Work

• A Study of the Restricted Random Walk
• On the Number of Self-Avoiding Walks
• Unnamed Item