Self-avoiding walks crossing a square
From MaRDI portal
Publication:5706149
DOI10.1088/0305-4470/38/42/001zbMATH Open1078.82009arXivcond-mat/0506341OpenAlexW3099802185WikidataQ67579111 ScholiaQ67579111MaRDI QIDQ5706149FDOQ5706149
Authors: Mireille Bousquet-Mélou, I. Jensen, Anthony J Guttmann
Publication date: 4 November 2005
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
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
Full work available at URL: https://arxiv.org/abs/cond-mat/0506341
Recommendations
Cited In (30)
- Title not available (Why is that?)
- Weakly self-avoiding walk on a high-dimensional torus
- A family of irreducible supersingular representations of \(\mathrm{GL}_2(F)\) for some ramified \(p\)-adic fields
- Title not available (Why is that?)
- A model of compact polymers on a family of three-dimensional fractal lattices
- A new type numerical model for action balance equation in simulating nearshore waves
- Self-avoiding walks contained within a square
- Counting cycles on planar graphs in subexponential time
- Counting cycles on planar graphs in subexponential time
- Title not available (Why is that?)
- Mean-field tricritical polymers
- On the importance sampling of self-avoiding walks
- Title not available (Why is that?)
- Effect of confinement: polygons in strips, slabs and rectangles
- The gerrymander sequence, or A348456
- Maker–Breaker percolation games I: crossing grids
- Walks on tiled boards
- The Hamiltonian path graph is connected for simple \(s,t\) paths in rectangular grid graphs
- Self-avoiding walk on the complete graph
- Exact solution of weighted partially directed walks crossing a square
- Self‐avoiding walk on the hypercube
- Critical behaviour of self-avoiding walks: that cross a square
- Self-avoiding walks and polygons confined to a square
- On the symmetry classes of planar self-avoiding walks
- Counting all self-avoiding walks on a finite lattice strip of width one and two
- 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
- Critical scaling of lattice polymers confined to a box without endpoint restriction
- Self-avoiding walks of specified lengths on rectangular grid graphs
- Self-avoiding walks on lattice strips
- Self-avoiding walks and polygons crossing a domain on the square and hexagonal lattices
This page was built for publication: Self-avoiding walks crossing a square
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5706149)