Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)
Summary: 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.
scientific article; zbMATH DE number 1446315