New upper bound for the connective constant for square-lattice self-avoiding walks
Combinatorics
2022-12-07 v2
Abstract
By modifying the automaton used by P{\"o}nitz and Tittman [4], and considering loops of length up to 26, we obtain 2.662343 as an upper bound for the connective constant in the lattice Z 2 .
Keywords
Cite
@article{arxiv.2211.16146,
title = {New upper bound for the connective constant for square-lattice self-avoiding walks},
author = {Olivier Couronné},
journal= {arXiv preprint arXiv:2211.16146},
year = {2022}
}