On self-avoiding polygons and walks: the snake method via polygon joining

TL;DR

This paper establishes an upper bound on the probability that a self-avoiding walk in two dimensions closes, using the snake method combined with polygon joining techniques, advancing understanding of self-avoiding walk behavior.

Contribution

It introduces a novel combination of the snake method and polygon joining to derive new upper bounds on closing probabilities for self-avoiding walks.

Findings

Closing probability in 2D is at most n^{-4/7 + o(1)} for certain odd n.

The snake method effectively bounds closing probabilities.

Polygon joining techniques enhance analysis of self-avoiding walks.

Abstract

For $d \geq 2$ and $n \in \mathbb{N}$, let $\mathsf{W}_n$ denote the uniform law on self-avoiding walks beginning at the origin in the integer lattice $\mathbb{Z}^d$, and write $\Gamma$ for a $\mathsf{W}_n$-distributed walk. We show that the closing probability $\mathsf{W}_n \big( \vert \vert \Gamma_n \vert \vert = 1 \big)$ that $\Gamma$'s endpoint neighbours the origin is at most $n^{-4/7 + o(1)}$ for a positive density set of odd $n$ in dimension $d = 2$. This result is proved using the snake method, a technique for proving closing probability upper bounds, which originated in [3] and was made explicit in [8]. Our conclusion is reached by applying the snake method in unison with a polygon joining technique whose use was initiated by Madras in [13].