Ascending Convex Polyominoes
Nicholas Beaton, Simone Rinaldi

TL;DR
This paper studies the structure and enumeration of Z-convex polyominoes and related subclasses, deriving explicit algebraic generating functions and asymptotic growth rates through combinatorial decompositions and functional equations.
Contribution
It introduces ascending polyominoes and a decomposition into subclasses, providing explicit algebraic generating functions and asymptotic analysis for Z-convex polyominoes.
Findings
Explicit algebraic generating functions for subclasses of Z-convex polyominoes.
Asymptotic growth rates of subclasses are determined.
Decomposition into three disjoint subclasses facilitates enumeration.
Abstract
Convex polyominoes can be refined according to the number of direction changes in monotone paths connecting pairs of cells, leading to the notion of -convexity. In particular, the cases and correspond to -convex and -convex polyominoes, two well-studied subclasses of convex polyominoes, with intermediate families such as centered and -stack polyominoes. These families exhibit remarkably different combinatorial behaviours, suggesting that geometric constraints have a strong impact on the nature of the generating function: -convex and centered polyominoes possess rational generating functions and growth of order and , respectively, while -convex, 4-stack, and convex polyominoes have algebraic functions and asymptotics of order , , and respectively. In this paper we investigate the structure of -convex…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
