Counting Polyominoes: A Parallel Implementation for Cluster Computing

The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimensional problems. The basic idea is to enumerate the problem on small finite lattices using a transfer-matrix formalism. Systematically grow the size of the lattices and combine the results in order to obtain the desired series for the infinite lattice limit. We have developed a parallel algorithm for the enumeration of polyominoes, which are connected sets of lattice cells joined at an edge. The algorithm implements the finite-lattice method and associated transfer-matrix calculations in a very efficient parallel setup. Test runs of the algorithm on a HP server cluster indicates that in this environment the algorithm scales perfectly from 2 to 64 processors.

[1]  I. Jensen.  Enumerations of Lattice Animals and Trees , 2000, cond-mat/0007239.

[2]  A. Conway.  Enumerating 2D percolation series by the finite-lattice method: theory , 1995 .

[3]  Tom C. Lubensky,et al.  Statistics of lattice animals and dilute branched polymers , 1979 .

[4]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 2 , 1981 .

[5]  Stephan Mertens,et al.  Counting lattice animals: A parallel attack , 1992 .

[6]  B. M. I. Rands,et al.  Animals, Trees and Renewal Sequences , 1981 .

[7]  D. Gaunt,et al.  Percolation processes in two dimensions IV. Percolation probability , 1976 .

[8]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[9]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[10]  I. Jensen,et al.  LETTER TO THE EDITOR: Statistics of lattice animals (polyominoes) and polygons , 2000, cond-mat/0007238.

[11]  Ian G. Enting,et al.  Generating functions for enumerating self-avoiding rings on the square lattice , 1980 .

[12]  Donald D. Spencer.  Computers in number theory , 1982 .

[13]  D. Klarner.  Cell Growth Problems , 1967, Canadian Journal of Mathematics.

[14]  D. Hugh Redelmeier,et al.  Counting polyominoes: Yet another attack , 1981, Discret. Math..

[15]  S. Golomb.  Polyominoes: Puzzles, Patterns, Problems, and Packings , 1994 .

[16]  M. Sykes,et al.  Percolation processes in two dimensions. I. Low-density series expansions , 1976 .

[17]  J. L. Martin,et al.  The impact of large-scale computing on lattice statistics , 1990 .

[18]  Andrew R. Conway,et al.  On two-dimensional percolation , 1995 .

[19]  Stephan Mertens,et al.  Lattice animals: A fast enumeration algorithm and new perimeter polynomials , 1990 .

[20]  R. L. Rive,et al.  ) I-- a Procedure for Improving the Upper Bound for the Number of N-ominoes By , 2022 .

[21]  S. Redner,et al.  Introduction To Percolation Theory , 2018 .