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

DOI10.1016/J.JDA.2005.08.001MaRDI QIDQ2457308zbMATH OpenOpenAlexFDO

Authors Gill Barequet, Micha Moffie

Publication date 30 October 2007

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2005.08.001

zbMATH Keywords

computational complexitypolyominoeslattice animals

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Asymptotic enumeration (05A16) Combinatorics on words (68R15) Polyominoes (05B50)

Recommendations

• Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes
• COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
• Counting polyominoes on twisted cylinders
• On the generation of convex polyominoes
• \(\lambda > 4\)

Cites work

• scientific article; zbMATH DE number 3148802 (Why is no real title available?)
• scientific article; zbMATH DE number 687006 (Why is no real title available?)
• scientific article; zbMATH DE number 3341062 (Why is no real title available?)
• A Procedure for Improving the Upper Bound for the Number of n-Ominoes
• Animals, Trees and Renewal Sequences: Corrigendum
• Cell Growth Problems
• Consecutive Primes in Arithmetic Progression
• Contributions to the Cell Growth Problem
• Counting lattice animals: A parallel attack
• Counting polyominoes on twisted cylinders
• Counting polyominoes: yet another attack
• Enumerating 2D percolation series by the finite-lattice method: theory
• Enumerations of lattice animals and trees
• On the complexity of Jensen's algorithm for counting fixed polyominoes
• On two-dimensional percolation
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products

Cited in

(4)

• On the complexity of Jensen's algorithm for counting fixed polyominoes
• \(\lambda > 4\)
• On the enumeration of permutominoes
• Counting polyominoes, revisited

This page was built for publication: On the complexity of Jensen's algorithm for counting fixed polyominoes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457308)