Convex polyominoes revisited: Enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees
Toufik Mansour, Reza Rastegar

TL;DR
This paper introduces a new column-by-column decomposition method for convex polyominoes, enabling enumeration of various statistics such as interior vertices, boundary vertices of specific degrees, and outer site perimeter, with detailed asymptotic results.
Contribution
It presents a novel decomposition technique for convex polyominoes that facilitates enumeration of multiple combinatorial statistics and derives their asymptotic behaviors.
Findings
Average interior vertices asymptotic to n^2/12 plus correction terms.
Average boundary vertices of degree two asymptotic to (n+6)/2 plus correction terms.
Number of convex polyominoes with perimeter n asymptotic to a constant times ( (3+√5)/2 )^n.
Abstract
The main contribution of this paper is a new column-by-column method for the decomposition of generating functions of convex polyominoes suitable for enumeration with respect to various statistics including but not limited to interior vertices, boundary vertices of certain degrees, and outer site perimeter. Using this decomposition, among other things, we show that A) the average number of interior vertices over all convex polyominoes of perimeter is asymptotic to B) the average number of boundary vertices with degree two over all convex polyominoes of perimeter is asymptotic to Additionally, we obtain an explicit generating function counting the number of convex polyominoes with boundary vertices of degrees at most three and show…
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.
