Counting d-dimensional polycubes and nonrectangular planar polyominoes

International Journal of Computational Geometry and Applications

Volumn 19, Issue 3, 2009, Pages 215-229

  Aleksandrowicz, Gadi ^a   Barequet, Gill ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Lattice animals; Polycubes; Subgraph counting

Indexed keywords

EID: 68049143168     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195909002927     Document Type: Conference Paper

References (20)

1. G. Barequet, M. Moffie, A. Ribó and G. Rote, Counting polyominoes on twisted cylinders, Integers (electronic journal) 6 (2006) #A22.
2. D. Beauquier and M. Nivat, On translating one polyomino to tile the plane, Discr. Comput. Geom. 6 (1991) 575-592.
3. S. R. Broadbent and J. M. Hammersley, Percolation processes: I. Crystals and mazes, Proc. Cambridge Philosophical Society 53 (1957) 629-641.
4. E. D. Demaine and M. L. Demaine, Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity, Graphs and Combinatorics, 2007, supplement (Akiyama-Chvátal Festschrift), to appear.
5. http://www.research.att.com/∼njas/sequences (the on-line encyclopedia of inte-ger sequences).
6. S. W. Golomb, Tiling with sets of polyominoes, J. Combinat. Th. 9 (1970) 60-71.
7. I. Jensen, Enumerations of lattice animals and trees, J. Statist. Phys. 102 (2001) 865-881.
8. I. Jensen, Counting polyominoes: A parallel implementation for cluster computing, Proc. Int. Conf. Computational Science, part III, Melbourne, Australia and St. Petersburg, Russia, Lecture Notes in Computer Science, 2659, Springer, 203-212, June 2003.
9. D. A. Klarner, Cell growth problems, Canadian J. Mathematics 19 (1967) 851-863.
10. D. A. Klarner and R. L. Rivest, A procedure for improving the upper bound for the number of n-ominoes, Canadian J. Mathematics 25 (1973) 585-602.
11. W. F. Lunnon, Counting polyominoes, in Computers in Number Theory, eds. A. O. L. Atkin and B. J. Birch (Academic Press, London, 1971), pp. 347-372.
12. W. F. Lunnon, Counting hexagonal and triangular polyominoes, in Graph Theory and Computing, ed. R. C. Read (Academic Press, New York, 1972), pp. 87-100.
13. W. F. Lunnon, Symmetry of cubical and general polyominoes, in Graph Theory and Computing, ed. R. C. Read (Academic Press, New York, 1972), pp. 101-108.
14. W. F. Lunnon, Counting multidimensional polyominoes, The Computer J. 18 (1975) 366-367.
15. N. Madras, A pattern theorem for lattice clusters, Ann. Combinatorics 3 (1999) 357-384.
16. J. L. Martin, Computer techniques for evaluating lattice constants, in Phase Transitions and Critical Phenomena, Vol. 3, eds. C. Domb and M. S. Green (Academic Press, London, 1974), pp. 97-112.
17. D. H. Redelmeier, Counting polyominoes: Yet another attack, Discr. Math. 36 (1981) 191-203.
18. M. Schwartz and T. Etzion, Two-dimensional cluster-correcting codes, IEEE Trans. Inform. Th. 51 (2005) 2121-2132.
19. M. F. Sykes, D. S. Gaunt and M. Glen, Percolation processes in three dimensions, J. of Physics, A: Mathematical and General 10 (1976) 1705-1712.
20. M. V̈oge and A. J. Guttmann, On the number of hexagonal polyominoes, Theoret. Comput. Sci. 307 (2003) 433-453.