Improved Upper Bounds for Self-Avoiding Walks in ${\bf Z}^{d}$
Keyword(s):
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.
2019 ◽
Vol 30
(06n07)
◽
pp. 1117-1134
Keyword(s):
1993 ◽
Vol 2
(2)
◽
pp. 115-136
◽
2018 ◽
Vol 29
(05)
◽
pp. 861-876
◽
2019 ◽
Vol 30
(01)
◽
pp. 5-27
Keyword(s):
1996 ◽
Vol 321
◽
pp. 335-370
◽
Keyword(s):
2012 ◽
Vol 10
(3)
◽
pp. 455-488
◽
Keyword(s):
2016 ◽
Vol 30
(4)
◽
pp. 622-639
◽