Gill Barequet, Micha Moffie, Ares Ribó, and Günter Rote:
Counting polyominoes on twisted cylinders
Mathematics and Theoretical
Computer Science AE (2005), 369-374.
Proceedings of the
European Conference on Combinatorics, Graph Theory and Applications
(EuroComb'05), 2005, Berlin, Germany. Editor: Stefan Felsner.
- INTEGERS: The
Electronic Journal of
Combinatorial Number Theory 6 (2006), article #A22, 37 pages.
Using numerical methods, we analyze the growth in the number of
on a twisted cylinder as the number of cells increases. These
related to classical polyominoes (connected subsets of a square grid)
in the plane. We thus obtain an improved lower bound of 3.980137 on the
growth rate of the number of polyominoes, which is also known as
constant. We use a dynamic programming approach. For storing
partial polyominos, we make use of a bijection between "states" of our
system and Motzkin paths.
Note after publication (2018)
Our main tool for certifying the quality of the eigenvalue
Lemma 2 in the paper 1 and
Lemma 9 in the paper 2,
turned out to be a classical result, known under the name
Last update: November 22, 2018.