A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice
From MaRDI portal
Publication:5388917
DOI10.1088/1751-8113/45/11/115202zbMath1241.82040arXiv1111.5877OpenAlexW2147622757MaRDI QIDQ5388917
Publication date: 24 April 2012
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.5877
Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items (13)
On the growth constant for square-lattice self-avoiding walks ⋮ Improved model for mixtures of polymers and hard spheres ⋮ Enumeration of planar Tangles ⋮ The design of efficient dynamic programming and transfer matrix enumeration algorithms ⋮ Counting all unfolded self-avoiding walks on a finite lattice strip of width three ⋮ A new look at the collapse of two-dimensional polymers ⋮ Two-sided prudent walks: a solvable non-directed model of polymer adsorption ⋮ Partition and generating function zeros in adsorbing self-avoiding walks ⋮ Exact enumeration of self-avoiding walks on BCC and FCC lattices ⋮ 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 ⋮ Supermultiplicative relations in models of interacting self-avoiding walks and polygons
This page was built for publication: A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice
