Counting Polycubes without the Dimensionality Curse
A d-D polycube of size n is a connected set of n cells (hypercubes) of an orthogonal d-dimensional lattice, where connectivity is through (d − 1)-dimensional faces of the cells. Computing A d (n), the number of distinct d-dimensional polycubes of size n, is a long-standing elusive problem in discrete geometry. In a previous work we described the generalization from two to higher dimensions of a polyomino-counting algorithm of Redelmeier. The main deficiency of the algorithm is that it keeps the entire set of cells that appear in any possible polycube in memory at all times. Thus, the amount of required memory grows exponentially with the dimension. In this paper we present a method whose order of memory consumption is a (very low) polynomial in both n and d. Furthermore, we parallelized the algorithm and ran it through the Internet on dozens of computers simultaneously. This enables us to find A d (n) for values of d and n far beyond any previous attempt.
KeywordsNeighboring Cell Percolation Process Connected Subgraph Underlying Graph Lattice Graph
Unable to display preview. Download preview PDF.
- 2.Barequet, R., Barequet, G.: Formulae and Growth Rates of High-Dimensional Polycubes (manuscript)Google Scholar
- 4.The on-line Encyclopedia of Integer Sequences, http://www.research.att.com/~njas/sequences
- 9.Lunnon, W.F.: Counting Polyominoes. In: Atkin, Birch (eds.) Computers in Number Theory, pp. 347–372. Academic Press, London (1971)Google Scholar
- 10.Lunnon, W.F.: Symmetry of Cubical and General Polyominoes. In: Read (ed.) Graph Theory and Computing, pp. 101–108. Academic Press, NY (1972)Google Scholar
- 13.Martin, J.L.: Computer Techniques for Evaluating Lattice Constants. In: Domb, Green (eds.) Phase Transitions and Critical Phenomena, vol. 3, pp. 97–112. Academic Press, London (1974)Google Scholar