Improved Upper Bounds for Self-Avoiding Walks in ${\bf Z}^{d}$

  • André Pönitz
  • Peter Tittmann
DOI: https://doi.org/10.37236/1499

Abstract

New upper bounds for the connective constant of self-avoiding walks in a hypercubic lattice are obtained by automatic generation of finite automata for counting walks with finite memory. The upper bound in dimension two is 2.679192495.

Published
2000-04-13
How to Cite
Pönitz, A., & Tittmann, P. (2000). Improved Upper Bounds for Self-Avoiding Walks in ${\bf Z}^{d}$. The Electronic Journal of Combinatorics, 7(1), R21. https://doi.org/10.37236/1499
Issue
Volume 7 (2000)
Article Number
R21