Enumeration on polyominoes determined by Catalan words avoiding $(\ge ,\ge )$

Abstract

A Catalan word of length $n$ that avoids the pattern $(\ge ,\ge )$ is a sequence $w=w_1\cdots w_n$ with $w_1=0$ and $0\le w_i\le w_{i-1}+1$ for all $i$, while ensuring that no subsequence satisfies $w_i\ge w_{i+1}\ge w_{i+2}$ for $i=2,\dots ,n$. These words are enumerated by the $n$-th Motzkin number. From such a word, we associate a $n$-column Motzkin polyomino (called a $(\ge ,\ge )$-polyomino), where the $i$-th column contains $w_i+1$ bottom-aligned cells. In this paper, we derive generating functions for $(\ge ,\ge )$-polyominoes based on their length, area, semiperimeter, last symbol value, and number of interior points. We provide asymptotic analyses and closed-form expressions for the total area, total semiperimeter, sum of the last symbol values, and total number of interior points across all $(\ge ,\ge )$-polyominoes of a given length. Finally, we express all these results as linear combinations of trinomial coefficients.