Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees

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 (Formula presented.) is asymptotic to (Formula presented.) (B) the average number of boundary vertices with degree two over all convex polyominoes of perimeter (Formula presented.) is asymptotic to (Formula presented.) Additionally, we obtain an explicit generating function counting the number of convex polyominoes with n boundary vertices of degrees at most three and show that this number is asymptotic to (Formula presented.) Moreover, we show that the expected number of the boundary vertices of degree four over all convex polyominoes with n vertices of degrees at most three is asymptotically (Formula presented.) (C) the number of convex polyominoes with the outer-site perimeter n is asymptotic to (Formula presented.) and show the expected number of the outer-site perimeter over all convex polyominoes with perimeter (Formula presented.) is asymptotic to (Formula presented.) Lastly, we prove that the expected perimeter over all convex polyominoes with the outer-site perimeter n is asymptotic to (Formula presented.).