Improved Upper Bounds for Self-Avoiding Walks in ${\bf Z}^{d}$
André Pönitz, Peter Tittmann · The Electronic Journal of Combinatorics · 2000
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.