Self-avoiding walks crossing a square
From MaRDI portal
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
Recommendations
Cited in
(33)- A new type numerical model for action balance equation in simulating nearshore waves
- Counting all self-avoiding walks on a finite lattice strip of width one and two
- Critical scaling of lattice polymers confined to a box without endpoint restriction
- Mean-field tricritical polymers
- On the importance sampling of self-avoiding walks
- A model of compact polymers on a family of three-dimensional fractal lattices
- Effect of confinement: polygons in strips, slabs and rectangles
- scientific article; zbMATH DE number 3954959 (Why is no real title available?)
- Statistics of confined chains. III: Hamiltonian paths
- scientific article; zbMATH DE number 6928775 (Why is no real title available?)
- On the symmetry classes of planar self-avoiding walks
- Critical behaviour of self-avoiding walks: that cross a square
- Maker–Breaker percolation games I: crossing grids
- Self-avoiding walks on lattice strips
- scientific article; zbMATH DE number 6456216 (Why is no real title available?)
- Self-avoiding walks contained within a square
- scientific article; zbMATH DE number 7651047 (Why is no real title available?)
- Self-avoiding walks and polygons crossing a domain on the square and hexagonal lattices
- Exact solution of weighted partially directed walks crossing a square
- Self-avoiding walks and polygons confined to a square
- Two-dimensional oriented self-avoiding walks with parallel contacts
- The gerrymander sequence, or A348456
- Self‐avoiding walk on the hypercube
- 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
- A family of irreducible supersingular representations of \(\mathrm{GL}_2(F)\) for some ramified \(p\)-adic fields
- Counting cycles on planar graphs in subexponential time
- Self-avoiding walks of specified lengths on rectangular grid graphs
- Weakly self-avoiding walk on a high-dimensional torus
- Counting cycles on planar graphs in subexponential time
- The Hamiltonian path graph is connected for simple s,t paths in rectangular grid graphs
- Walks on tiled boards
- Step-constrained self-avoiding walks on finite grids
- Self-avoiding walk on the complete graph
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)