Counting $r\times s$ rectangles in nondecreasing and Smirnov words

Abstract

The rectangle capacity, a word statistic that was recently introduced by the author and Mansour, counts, for two fixed positive integers $r$ and $s$, the number of occurrences of a rectangle of size $r\times s$ in the bargraph representation of a word. In this work we find the bivariate generating function for the distribution on nondecreasing words of the number of $r\times s$ rectangles and the generating function for their total number over all nondecreasing words. We also obtain the analog results for Smirnov words, which are words that have no consecutive equal letters. This complements our recent results concerned with general words (i.e., not restricted) and Catalan words.

Figures (2)

• Figure 1: The bargraph representation of the word $345134$
• Figure 2: There are four occurrences of a rectangle of size $3\times 2$ in the bargraph representation of the word $345134$.

Theorems & Definitions (23)

• Theorem 1
• proof
• Corollary 2
• proof
• Example 3
• Lemma 4
• proof
• Theorem 5
• proof
• Corollary 6