Abstract
In this paper we consider a restricted class of polyominoes that we call Z-convex polyominoes. Z-convex polyominoes are polyominoes such that any two pairs of cells can be connected by a monotone path making at most two turns (like the letter Z). This class of convex polyominoes appears to resist standard decompositions, so we propose a construction by "inflation" that allows to write a system of functional equations for their generating functions. The generating function P (t) of Z-convex polyominoes with respect to the semi-perimeter turns out to be algebraic all the same and surprisingly, like the generating function of convex polyominoes, it can be expressed as a rational function of t and the generating function of Catalan numbers.
| Original language | English |
|---|---|
| Pages (from-to) | 54-72 |
| Number of pages | 19 |
| Journal | Advances in Applied Mathematics |
| Volume | 40 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Jan 2008 |
Keywords
- Algebraic generating functions
- Enumeration
- Recursive decomposition
Fingerprint
Dive into the research topics of 'The number of Z-convex polyominoes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver