2025/02/15 by Mark Shattuck, Shattuck, Mark
Computer Science · #05A05 #05A15 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2502.10661
openalex publication_date 2025/02/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A Catalan word w is said to be flattened if the subsequence of w obtained by taking the first letter of each weakly increasing run is nondecreasing. Let Fn denote the set of flattened Catalan words of length n, which has cardinality \frac3n-1+12 for all n ≥ 1. In this paper, we consider the distribution of several consecutive patterns on Fn. Indeed, we find explicit formulas for the generating functions of the joint distribution on Fn of several trios of patterns, along with an auxiliary parameter. As special cases of these formulas, we obtain the generating function for the distribution of all consecutive patterns of length two or three. The following equivalences with regard to being identically distributed on Fn arise when comparing the various generating functions and may be explained bijectively: 112≈122 and 211≈221≈231. In addition, explicit expressions are found for the total number of occurrences on Fn of each pattern of length two or three as well as for the number of avoiders of each pattern. These results can be obtained as special cases of our more general formulas for the generating functions, but may be explained combinatorially as well, the arguments of which are featured herein.