An upper bound for the connective constant of the square lattice
Source: hexagonmath.org/abs/2611.00474v1
We prove that the connective constant $\mu$ of the square lattice $\mathbb{Z}^2$, the exponential growth rate of the number of $n$-step self-avoiding walks, satisfies $\mu\le2.6586513$. The previous best upper bound, $\mu\le2.662342426$, is due to Couronné. Like the bounds of Pönitz and Tittmann and of Couronné, ours comes from a finite automaton that remembers a bounded part of the past of the walk. The new idea is to count bridges. Since they can all be preceded by the same infinite history, the automaton may treat as visited the unvisited cells that no infinite self-avoiding continuation…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00474
curl -X POST /api/v1/records/hexagon/2611.00474/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00474/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'