Enumeration of self-avoiding walks on the square lattice

DOI10.1088/0305-4470/37/21/002zbMath1058.82009arXivcond-mat/0404728OpenAlexW3102109888MaRDI QIDQ3159925

Iwan Jensen

Publication date: 1 February 2005

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0404728

Mathematics Subject Classification ID

Related Items (20)

Spatial mixing and the connective constant: optimal bounds ⋮ The interpolation between random walk and self-avoiding walk by avoiding marked sites ⋮ Two-dimensional interacting self-avoiding walks: new estimates for critical temperatures and exponents ⋮ Efficient algorithm for computing exact partition functions of lattice polymer models ⋮ Exact enumeration of self-avoiding walks on critical percolation clusters in 2–7 dimensions ⋮ Scale-free Monte Carlo method for calculating the critical exponentγof self-avoiding walks ⋮ Critical loop gases and the worm algorithm ⋮ Improved model for mixtures of polymers and hard spheres ⋮ Parallel algorithm for calculation of the exact partition function of a lattice polymer ⋮ Counting all unfolded self-avoiding walks on a finite lattice strip of width three ⋮ ALGEBRAIC AND GEOMETRIC PROPERTIES OF LATTICE WALKS WITH STEPS OF EQUAL LENGTH ⋮ Series analysis of a Kosterlitz-Thouless transition: the 6-state planar Potts model ⋮ Exact enumeration of self-avoiding walks ⋮ Partition and generating function zeros in adsorbing self-avoiding walks ⋮ The Hammersley-Welsh bound for self-avoiding walk revisited ⋮ Modeling force-induced bio-polymer unfolding ⋮ Polygons and the Lace Expansion ⋮ Sequential stratified splitting for efficient Monte Carlo integration ⋮ Transfer matrix algorithm for computing the exact partition function of a square lattice polymer ⋮ Self-avoiding walks contained within a square

This page was built for publication: Enumeration of self-avoiding walks on the square lattice