Abstract
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.
Work on this paper has been supported in part by Jewish Communities of Germany Research Fund.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aleksandrowicz, G., Barequet, G.: Counting d-dimensional Polycubes and Nonrectangular Planar Polyominoes. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 418–427. Springer, Heidelberg (2006)
Barequet, R., Barequet, G.: Formulae and Growth Rates of High-Dimensional Polycubes (manuscript)
Broadbent, S.R., Hammersley, J.M.: Percolation Processes: I. Crystals and mazes. Proc.Cambridge Philosophical Society 53, 629–641 (1957)
The on-line Encyclopedia of Integer Sequences, http://www.research.att.com/~njas/sequences
Jensen, I.: Enumerations of Lattice Animals and Trees. J. of Statistical Physics 102, 865–881 (2001)
Jensen, I.: Counting Polyominoes: A Parallel Implementation for Cluster Computing. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2659, pp. 203–212. Springer, Heidelberg (2003)
Klarner, D.A.: Cell Growth Problems. Canadian J. of Mathematics 19, 851–863 (1967)
Lunnon, W.F.: Counting Polyominoes. In: Atkin, Birch (eds.) Computers in Number Theory, pp. 347–372. Academic Press, London (1971)
Lunnon, W.F.: Symmetry of Cubical and General Polyominoes. In: Read (ed.) Graph Theory and Computing, pp. 101–108. Academic Press, NY (1972)
Lunnon, W.F.: Counting Multidimensional Polyominoes. The Computer Journal 18, 366–367 (1975)
Madras, N.: A Pattern Theorem for Lattice Clusters. Annals of Combinatorics 3, 357–384 (1999)
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)
Mertens, S., Lautenbacher, M.E.: Counting Lattice Animals: A Parallel Attack. J. of Statistical Physics 66, 669–678 (1992)
Redelmeier, D.H.: Counting Polyominoes: Yet Another Attack. Discrete Mathematics 36, 191–203 (1981)
Sykes, M.F., Gaunt, D.S., Glen, M.: Percolation Processes in Three Dimensions. J. of Physics, A: Mathematical and General 10, 1705–1712 (1976)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aleksandrowicz, G., Barequet, G. (2008). Counting Polycubes without the Dimensionality Curse . In: Hu, X., Wang, J. (eds) Computing and Combinatorics. COCOON 2008. Lecture Notes in Computer Science, vol 5092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69733-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-69733-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69732-9
Online ISBN: 978-3-540-69733-6
eBook Packages: Computer ScienceComputer Science (R0)