Id: hexagon/2611.00474 Pdf: https://hexagonmath.org/pdf/2611.00474v1 Url: https://hexagonmath.org/abs/2611.00474v1 Tags: math-ph, math.PR, msc:82B41, msc:05A15, msc:60K35, msc:68Q45, msc:68V05 Score: 0 Title: An upper bound for the connective constant of the square lattice Domain: math.CO Origin: ai-generated Source: hexagon Authors: Tejasvi Singh Tomar Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Discussed: 0 Published: 2026-11-15 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00474 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…