On the complexity of Jensen's algorithm for counting fixed polyominoes

Journal of Discrete Algorithms

Volumn 5, Issue 2 SPEC. ISS., 2007, Pages 348-355

  Barequet, Gill ^a   Moffie, Micha ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b Northeastern University   (United States)

Author keywords

Computational complexity; Lattice animals; Polyominoes

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; NUMBER THEORY; NUMERICAL ANALYSIS; POLYNOMIALS;

EMPIRICAL EVIDENCES; LATTICE ANIMALS; MOTZKIN NUMBERS; POLYOMINOES;

ALGORITHMS;

EID: 34247166107     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2005.08.001     Document Type: Article

References (25)

1. G. Barequet, M. Moffie, The complexity of Jensen's algorithm for counting polyominoes, in: Proc. 1st Workshop on Analytic Algorithmics and Combinatorics, New Orleans, LA, January 2004, pp. 161-169
2. G. Barequet, M. Moffie, A. Ribó, G. Rote, Counting polyominoes on twisted cylinders, in: Proc. 3rd European Conf. on Combinatorics, Graph Theory, and Applications, Berlin, Germany, September 2005, pp. 369-374. Full version: Integers, accepted for publication
3. Broadbent S.R., and Hammersley J.M. Percolation processes: I. Crystals and mazes. Proceedings of the Cambridge Philosophical Society 53 (1957) 629-641
4. Conway A.R. Enumerating 2D percolation series by the finite-lattice method: Theory. Journal of Physics, A: Mathematical and General 28 (1995) 335-349
5. Conway A.R., and Guttmann A.J. On two-dimensional percolation. Journal of Physics, A: Mathematical and General 28 (1995) 891-904
6. Golomb S.W. Polyominoes. second ed. (1994), Princeton Univ. Press, Princeton, NJ
7. Jensen I. Enumerations of lattice animals and trees. Journal of Statistical Physics 102 (2001) 865-881
8. Jensen I. http://sunburn.stanford.edu/~knuth/programs/jensen.txt a personal communication with D.E. Knuth
9. Jensen I. Counting polyominoes: A parallel implementation for cluster computing. Proc. Int. Conf. on Computational Science. Melbourne, Australia. Lecture Notes in Computer Science vol. 2659 (August 2003), Springer-Verlag, Heidelberg 203-212
10. Klarner D.A. Cell growth problems. Canadian Journal of Mathematics 19 (1967) 851-863
11. Klarner D.A., and Rivest R.L. A procedure for improving the upper bound for the number of n-ominoes. Canadian Journal of Mathematics 25 (1973) 585-602
12. Knuth D.E. http://sunburn.stanford.edu/~knuth/programs.html#polyominoes a personal WWW page
13. Lubensky T.C., and Isaacson J. Statistics of lattice animals and dilute branched polymers. Physical Review A 20 (1979) 2130-2146
14. Lunnon W.F. Counting polyominoes. In: Atkin A.O.L., and Birch B.J. (Eds). Computers in Number Theory (1971), Academic Press, London 347-372
15. Martin J.L. Computer techniques for evaluating lattice constants. In: Domb C., and Green M.S. (Eds). Phase Transitions and Critical Phenomena, vol. 3 (1974), Academic Press, London 97-112
16. Mertens S., and Lautenbacher M.E. Counting lattice animals: A parallel attack. Journal of Statistical Physics 66 (1992) 669-678
17. Motzkin T. Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products. Bulletin of the American Mathematical Society 54 (1948) 352-360
18. Oliveira e Silva T. http://www.ieeta.pt/~tos/animals/a44.html a personal WWW page
19. T.R. Parkin, L.J. Lander, D.R. Parkin, Polyomino enumeration results, in: SIAM Fall Meeting, Santa Barbara, CA, 1967
20. Rands B.M.I., and Welsh D.J.A. Animals, trees and renewal sequences. IMA Journal of Applied Mathematics 27 (1981) 1-17
21. Corrigendum:. IMA Journal of Applied Mathematics 28 (1982) 107
22. Read R.C. Contributions to the cell growth problem. Canadian Journal of Mathematics 14 (1962) 1-20
23. Redelmeier D.H. Counting polyominoes: Yet another attack. Discrete Mathematics 36 (1981) 191-203
24. Redner S. A Fortran program for cluster enumeration. Journal of Statistical Physics 29 (1982) 309-315
25. Sykes M.F., and Glen M. Percolation processes in two dimensions: I. Low-density series expansions. Journal of Physics, A: Mathematical and General 9 (1976) 87-95