Enumeration of $k$-convex polyominoes by semi-perimeter

Abstract

We prove the Conway--Guttmann formula for the generating function of $k$-convex polyominoes by semi-perimeter, for every $k\ge2$. A decomposition according to the two diagonal directions reduces the enumeration to convex polyominoes satisfying a one-bend condition in one diagonal direction. Splitting these polyominoes at the right endpoint of the top row leaves an initial part followed by columns whose vertical intervals decrease by inclusion. Ordered forests describe the initial part and retain the row information needed to determine when column extensions first exceed the prescribed bound. A first-passage calculation, together with a sum over initial parts already above the bound, gives the required generating function. The argument includes the case $k=2$.