Journal article

Two generalizations of column-convex polygons

S Feretic, AJ Guttmann

Journal of Physics A Mathematical and Theoretical | IOP PUBLISHING LTD | Published : 2009

Abstract

Column-convex polygons were first counted by area several decades ago, and the result was found to be a simple, rational, generating function. In this work we generalize that result. Let a p-column polyomino be a polyomino whose columns can have 1, 2, ..., p connected components. Then column-convex polygons are equivalent to 1-convex polyominoes. The area generating function of even the simplest generalization, namely 2-column polyominoes, is unlikely to be solvable. We therefore define two classes of polyominoes which interpolate between column-convex polygons and 2-column polyominoes. We derive the area generating functions of those two classes, using extensions of existing algorithms. The..

View full abstract

University of Melbourne Researchers

Grants

Funding Acknowledgements

One of us (AJG) wishes to acknowledge the hospitality of the Mittag-Leffler Institute where this work was, in part, carried out during the semester on Discrete Probability (January-June 2009). Financial support from the Australian Research Council is also gratefully acknowledged.