Self-avoiding walks crossing a square
arXiv:cond-mat/0506341 · doi:10.1088/0305-4470/38/42/001
Abstract
We study a restricted class of self-avoiding walks (SAW) which start at the origin (0, 0), end at , and are entirely contained in the square on the square lattice . The number of distinct walks is known to grow as . We estimate as well as obtaining strict upper and lower bounds, We give exact results for the number of SAW of length for and asymptotic results for . We also consider the model in which a weight or {\em fugacity} is associated with each step of the walk. This gives rise to a canonical model of a phase transition. For the average length of a SAW grows as , while for it grows as . Here is the growth constant of unconstrained SAW in . For we provide numerical evidence, but no proof, that the average walk length grows as . We also consider Hamiltonian walks under the same restriction. They are known to grow as on the same lattice. We give precise estimates for as well as upper and lower bounds, and prove that
27 pages, 9 figures. Paper updated and reorganised following refereeing
Cited by in corpus (11)
- Exact enumeration of Hamiltonian circuits, walks, and chains in two and three dimensions
- Weakly self-avoiding walk on a high-dimensional torus
- On the importance sampling of self-avoiding walks
- Self-avoiding walks contained within a square
- Self-Avoiding Walk on Fractal Complex Networks: Exactly Solvable Cases
- Mean-field tricritical polymers
- A model of compact polymers on a family of three-dimensional fractal lattices
- Self-avoiding walks and polygons crossing a domain on the square and hexagonal lattices
- Exact solution of weighted partially directed walks crossing a square
- Phase diagrams of confined square lattice links
- The gerrymander sequence, or A348456