The problem
Draw a path along a square grid without visiting any vertex twice. After connecting two marked boundary points and making the grid finer, does its random shape approach one continuous-curve law? The question uses critical weights for different path lengths and asks about the shape with the timing of the steps forgotten.[1] [2]
A critical random path that cannot revisit a vertex is conjectured to have a continuum shape law. Is that true for square-grid walks between two fixed boundary points? Approximate a bounded simply connected planar domain with smooth boundary and two distinct marked boundary points. Assign each nearest-neighbor self-avoiding walk of length weight , where is the square-lattice connective constant; normalize over the allowed walks and forget the step parametrization. The target is weak convergence of these traces to chordal as the mesh vanishes.[1] [2]
Scope
Chordal critical nearest-neighbor self-avoiding walks in square-lattice approximations of bounded simply connected planar domains with smooth boundaries, between two distinct marked boundary points. Normalize weights μ^(−length), where μ is the square-lattice connective constant; consider curve traces modulo parametrization.
What remains open
The cited candidate argument assumes existence of a conformally covariant scaling limit and the relevant restriction structure. Its authors explicitly leave precise conditional-theorem hypotheses unchecked in that discussion. Proving the discrete-to-continuum passage remains necessary; natural-parametrization convergence of random-walk frontiers does not imply it for self-avoiding walks.[1] [2] [3]
Why it matters
A local no-revisit rule imposes long-range dependence, yet its proposed continuum law has rigid conformal structure. This would connect microscopic exclusion to macroscopic curve geometry and explain why continuum calculations predict scaling behavior for planar polymer models. Rigorous properties of the candidate curve alone cannot justify those predictions for the lattice paths.[1] [2]
Definitions
3 terms
connective constant
The exponential growth rate of the number of long self-avoiding walks from a fixed vertex on the chosen lattice. Its reciprocal gives the critical weight per step; the square-lattice value need not be known exactly to state the question.[1] [2]
chordal
Boundary to boundary: the random curve joins two distinct marked boundary points of a planar region. This differs from a curve with an interior endpoint or a closed loop.[1]
Sources
- On the scaling limit of planar self-avoiding walk
Notes on On the scaling limit of planar self-avoiding walk
Defines critical chordal measures and gives conditional SLE identification.
- Self-avoiding walk, spin systems and renormalization
Notes on Self-avoiding walk, spin systems and renormalization
Researcher review distinguishes conjectured planar scaling limits.
- Convergence in natural parametrization of random walk frontier
Notes on Convergence in natural parametrization of random walk frontier
Published progress for random-walk frontiers leaves self-avoiding walks distinct.