Algebraic techniques for enumerating self-avoiding walks on the square lattice

DOI10.1088/0305-4470/26/7/012zbMath0772.60094arXivhep-lat/9211062OpenAlexW3106046729WikidataQ67576592 ScholiaQ67576592MaRDI QIDQ4694898

Andrew R. Conway, Ian G. Enting, Anthony J. Guttmann

Publication date: 29 September 1993

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

Full work available at URL: https://arxiv.org/abs/hep-lat/9211062

zbMATH Keywords

computational complexitycritical exponentself-avoiding walkscritical amplitude

Mathematics Subject Classification ID

Other physical applications of random processes (60K40) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Related Items (18)

Two-dimensional interacting self-avoiding walks: new estimates for critical temperatures and exponents ⋮ Efficient algorithm for computing exact partition functions of lattice polymer models ⋮ Scale-free Monte Carlo method for calculating the critical exponentγof self-avoiding walks ⋮ 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids ⋮ The design of efficient dynamic programming and transfer matrix enumeration algorithms ⋮ The enumeration of prudent polygons by area and its unusual asymptotics ⋮ A new look at the collapse of two-dimensional polymers ⋮ New lower bounds on the self-avoiding-walk connective constant ⋮ Enumeration of compact self-avoiding walks ⋮ Two-dimensional oriented self-avoiding walks with parallel contacts ⋮ History and Introduction to Polygon Models and Polyominoes ⋮ Mean area of self-avoiding loops ⋮ Enumeration of the self-avoiding polygons on a lattice by the Schwinger-Dyson equations ⋮ Transfer matrix algorithm for computing the exact partition function of a square lattice polymer ⋮ Synergistic development of differential approximants and the finite lattice method in lattice statistics ⋮ Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons ⋮ Self-avoiding walks ⋮ Self-avoiding walks and polygons crossing a domain on the square and hexagonal lattices

This page was built for publication: Algebraic techniques for enumerating self-avoiding walks on the square lattice