English

Self-avoiding walks crossing a square

Statistical Mechanics 2016-08-31 v2 Combinatorics

Abstract

We study a restricted class of self-avoiding walks (SAW) which start at the origin (0, 0), end at (L,L)(L, L), and are entirely contained in the square [0,L]×[0,L][0, L] \times [0, L] on the square lattice Z2{\mathbb Z}^2. The number of distinct walks is known to grow as λL2+o(L2)\lambda^{L^2+o(L^2)}. We estimate λ=1.744550±0.000005\lambda = 1.744550 \pm 0.000005 as well as obtaining strict upper and lower bounds, 1.628<λ<1.782.1.628 < \lambda < 1.782. We give exact results for the number of SAW of length 2L+2K2L + 2K for K=0,1,2K = 0, 1, 2 and asymptotic results for K=o(L1/3)K = o(L^{1/3}). We also consider the model in which a weight or {\em fugacity} xx is associated with each step of the walk. This gives rise to a canonical model of a phase transition. For x<1/μx < 1/\mu the average length of a SAW grows as LL, while for x>1/μx > 1/\mu it grows as L2L^2. Here μ\mu is the growth constant of unconstrained SAW in Z2{\mathbb Z}^2. For x=1/μx = 1/\mu we provide numerical evidence, but no proof, that the average walk length grows as L4/3L^{4/3}. We also consider Hamiltonian walks under the same restriction. They are known to grow as τL2+o(L2)\tau^{L^2+o(L^2)} on the same L×LL \times L lattice. We give precise estimates for τ\tau as well as upper and lower bounds, and prove that τ<λ.\tau < \lambda.

Keywords

Cite

@article{arxiv.cond-mat/0506341,
  title  = {Self-avoiding walks crossing a square},
  author = {M. Bousquet-Mélou and A. J. Guttmann and I. Jensen},
  journal= {arXiv preprint arXiv:cond-mat/0506341},
  year   = {2016}
}

Comments

27 pages, 9 figures. Paper updated and reorganised following refereeing