The complexity of Jensen's algorithm for counting polyominoes

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2004, Pages 161-169

  Barequet, Gill ^a   Moffie, Micha ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Computational complexity; Lattice animals; Polyominoes

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATRIX ALGEBRA; NUMBER THEORY; OPTIMIZATION; POLYNOMIALS;

JENSEN ESTIMATION; LATTICE ANIMALS; MOTZKIN NUMBERS; POLYOMINOES;

COMPUTATIONAL COMPLEXITY;

EID: 8344250977     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. [BH57] S.R. BROADBENT AND J.M. HAMMERSLEY, Percolation processes: I. Crystals and mazes, Proc. Cambridge Philosophical Society, 53 (1957), 629-641.
2. [Co95] A.R. CONWAY, Enumerating 2D percolation series by the finite-lattice method: Theory J. Physics, A: Mathematical and General, 28 (1995), 335-349.
3. [CG95] A.R. CONWAY AND A.J. GUTTMANN, On two-dimensional percolation, J. Physics, A: Mathematical and General, 28 (1995), 891-904.
4. [Go65] S.W. GOLOMB, Polyominoes, 2nd ed., Princeton Univ. Press, 1994.
5. [Je01] I. JENSEN, Enumerations of lattice animals and trees, J. of Statistical Physics, 102 (2001), 865-881.
6. [Je01a] I. JENSEN, http://sunburn.stanford.edu/~knuth/programs/jensen.txt (a personal communication with D.E. Knuth).
7. [Kl67] D.A. KLARNER, Cell growth problems, Canadian J. of Mathematics, 19 (1967), 851-863.
8. [Kn01] D.E. KNUTH, http://sunburn.stanford.edu/~knuth/programs. html~polyominoes (a personal WWW page).
9. [Lu71] W.F. LUNNON, Counting polyominoes, in: Computers in Number Theory (A.O.L. Atkin and B.J. Birch, eds.), Academic Press, London, 1971, 347-372.
10. [Ma74] J.L. MARTIN, Computer techniques for evaluating lattice constants, in: Phase Transitions and Critical Phenomena, vol. 3 (C. Domb and M.S. Green, eds.), Academic Press, London, 97-112, 1974.
11. [ML92] S. MERTENS AND M.E. LAUTENBACHER, Counting lattice animals: A parallel attack, J. of Statistical Physics, 66 (1992), 669-678.
12. [Mo48] T. MOTZKIN, Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products, Bull. American Mathematical Society, 54 (1948), 352-360.
13. [Ol01] T. OLIVEIRA E SILVA, http://www.ieeta.pt/~tos/animals/a44.html (a personal WWW page).
14. [PLP67] T.R. PARKIN, L.J. LANDER, AND D.R. PARKIN, Polyomino enumeration results, SIAM Fall Meeting, Santa Barbara, CA, 1967.
15. [Re62] R.C. READ, Contributions to the cell growth problem, Canadian J. of Mathematics, 14 (1962), 1-20.
16. [Re81] D.H. REDELMEIER, Counting Polyominoes: Yet another attack, Discrete Mathematics, 36 (1981), 191-203.
17. [Re82] S. REDNER, A Fortran program for cluster enumeration, J. of Statistical Physics, 29 (1982), 309-315.
18. [SG76] M.F. SYKES AND M. GLEN, Percolation processes in two dimensions: I. Low-density series expansions, J. Physics, A: Mathematical and General, 9 (1976), 87-95.