Formulae for Polyominoes on Twisted Cylinders
Polyominoes are edge-connected sets of cells on the square lattice ℤ2. We investigate polyominoes on a square lattice embedded on so-called twisted cylinders of a bounded width (perimeter) w. We prove that the limit growth rate of polyominoes of the latter type approaches that of polyominoes of the former type, as w tends to infinity. We also prove that for any fixed value of w, the formula enumerating polyominoes on a twisted cylinder of width w satisfies a linear recurrence whose complexity grows exponentially with w. By building the finite automaton that “grows” polyominoes on the twisted cylinder, we obtain the prefix of the sequence enumerating these polyominoes. Then, we recover the recurrence formula by using the Berlekamp-Massey algorithm.
KeywordsRecurrence formula transfer matrix generating function
Unable to display preview. Download preview PDF.
- 1.Barequet, G.: Recurrence data for polyominoes on twisted cylinders, http://www.cs.technion.ac.il/~barequet/twisted/
- 3.Barequet, G., Moffie, M., Ribó, A., Rote, G.: Counting polyominoes on twisted cylinders. Integers 6, #A22 (2006)Google Scholar
- 13.Stanley, R.: Enumerative Combinatorics, I. Cambridge University Press (1997)Google Scholar