Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons

Samuel Zbarsky

We give an algorithm for counting self-avoiding walks or self-avoiding polygons that runs in time $\exp (C\sqrt{n\log n})$ on 2-dimensional lattices and time $\exp(C_dn^{(d-1)/d}\lo…