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

André Pönitz, Peter Tittmann

Source record

Source: Crossref

Published: Apr 13, 2000

DOI: 10.37236/1499

Open original source ↗

Source 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.