Asymptotics of Z-convex polyominoes

This is the authors' abstract. We don't add key points for this paper.

The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of P can be joined by a monotone path inside P with at most k changes of direction. In this paper we show that one can compute in polynomial time the number of polyominoes of area n and degree of convexity at most 2 (the so-called Z-convex polyominoes). The integer sequence that we have computed allows us to conjecture the asymptotic number a n of Z-convex polyominoes of area n , ɑ n ∼ C ·exp(π)√11 n /4⁄ n 3/2 .