Advertisement

Counting Polycubes without the Dimensionality Curse

  • Gadi Aleksandrowicz
  • Gill Barequet
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5092)

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.

Keywords

Neighboring Cell Percolation Process Connected Subgraph Underlying Graph Lattice Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Barequet, R., Barequet, G.: Formulae and Growth Rates of High-Dimensional Polycubes (manuscript)Google Scholar
  3. 3.
    Broadbent, S.R., Hammersley, J.M.: Percolation Processes: I. Crystals and mazes. Proc.Cambridge Philosophical Society 53, 629–641 (1957)zbMATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    The on-line Encyclopedia of Integer Sequences, http://www.research.att.com/~njas/sequences
  5. 5.
  6. 6.
    Jensen, I.: Enumerations of Lattice Animals and Trees. J. of Statistical Physics 102, 865–881 (2001)zbMATHCrossRefGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    Klarner, D.A.: Cell Growth Problems. Canadian J. of Mathematics 19, 851–863 (1967)zbMATHMathSciNetGoogle Scholar
  9. 9.
    Lunnon, W.F.: Counting Polyominoes. In: Atkin, Birch (eds.) Computers in Number Theory, pp. 347–372. Academic Press, London (1971)Google Scholar
  10. 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
  11. 11.
    Lunnon, W.F.: Counting Multidimensional Polyominoes. The Computer Journal 18, 366–367 (1975)CrossRefMathSciNetzbMATHGoogle Scholar
  12. 12.
    Madras, N.: A Pattern Theorem for Lattice Clusters. Annals of Combinatorics 3, 357–384 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 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
  14. 14.
    Mertens, S., Lautenbacher, M.E.: Counting Lattice Animals: A Parallel Attack. J. of Statistical Physics 66, 669–678 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Redelmeier, D.H.: Counting Polyominoes: Yet Another Attack. Discrete Mathematics 36, 191–203 (1981)zbMATHMathSciNetGoogle Scholar
  16. 16.
    Sykes, M.F., Gaunt, D.S., Glen, M.: Percolation Processes in Three Dimensions. J. of Physics, A: Mathematical and General 10, 1705–1712 (1976)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Gadi Aleksandrowicz
    • 1
  • Gill Barequet
    • 1
  1. 1.Center for Graphics and Geometric Computing Dept. of Computer ScienceTechnion—Israel Institute of TechnologyHaifaIsrael

Personalised recommendations