A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice

DOI10.1088/1751-8113/45/11/115202MaRDI QIDQ5388917zbMATH OpenOpenAlexFDO

Authors Nathan Clisby, I. Jensen

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

Mathematics Subject Classification ID

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)

Abstract: We present a new and more efficient implementation of transfer-matrix methods for exact enumerations of lattice objects. The new method is illustrated by an application to the enumeration of self-avoiding polygons on the square lattice. A detailed comparison with the previous best algorithm shows significant improvement in the running time of the algorithm. The new algorithm is used to extend the enumeration of polygons to length 130 from the previous record of 110.

Recommendations

• Transfer matrix algorithm for computing the exact partition function of a square lattice polymer
• Exact enumerations
• Enumeration of compact self-avoiding walks
• Enumeration of self-avoiding trails on a square lattice using a transfer matrix technique
• Exact enumeration of self-avoiding walks

Cited in

(20)

• Enumeration of compact self-avoiding walks
• Enumeration of planar Tangles
• Transfer matrix algorithm for computing the exact partition function of a square lattice polymer
• Counting all unfolded self-avoiding walks on a finite lattice strip of width three
• A new look at the collapse of two-dimensional polymers
• The design of efficient dynamic programming and transfer matrix enumeration algorithms
• On the growth constant for square-lattice self-avoiding walks
• Exact enumeration of self-avoiding walks on BCC and FCC lattices
• Improved model for mixtures of polymers and hard spheres
• Two-sided prudent walks: a solvable non-directed model of polymer adsorption
• Supermultiplicative relations in models of interacting self-avoiding walks and polygons
• Enumeration of self-avoiding trails on a square lattice using a transfer matrix technique
• Synergistic development of differential approximants and the finite lattice method in lattice statistics
• Puiseux series expansions for the eigenvalues of transfer matrices and partition functions from the Newton polygon method for nanotubes and ribbons
• Distribution of available options for self avoiding walks on lattices at the last step
• Exact enumerations
• Exponential growth rate of lattice comb polymers
• Partition and generating function zeros in adsorbing self-avoiding walks
• Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons
• The umbral transfer-matrix method. IV: Counting self-avoiding polygons and walks

This page was built for publication: A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388917)