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

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.

17 pages, 8 figures, IoP style files

References in corpus (1)

• Exactly solved models of polyominoes and polygons

Cited by in corpus (22)

• Calculation of the connective constant for self-avoiding walks via the pivot algorithm
• Scale-free Monte Carlo method for calculating the critical exponent $\gamma$ of self-avoiding walks
• Compressed self-avoiding walks, bridges and polygons
• Pulling adsorbed self-avoiding walks from a surface
• On the growth constant for square-lattice self-avoiding walks
• Exact enumeration of self-avoiding walks on BCC and FCC lattices
• Parallel PERM
• Tight Error Bounds for Structured Prediction
• Pressure exerted by a grafted polymer on the limiting line of a semi-infinite square lattice
• Endless self-avoiding walks
• Square lattice self-avoiding walks and biased differential approximants
• Partition and generating function zeros in adsorbing self-avoiding walks
• A solvable non-directed model of polymer adsorption
• A series test of the scaling limit of self-avoiding walks
• Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons
• Numerical estimates of square lattice star vertex exponents
• The design of efficient algorithms for enumeration
• Estimating Residual Connectivity for Random Graphs
• Entropic exponents of grafted lattices stars
• Supermultiplicative relations in models of interacting self-avoiding walks and polygons
• Enumeration of planar Tangles
• Errata and Addenda to Mathematical Constants