Catalan words avoiding a pattern of length four
Contributions to Discrete Mathematics · 2026
DOI: 10.55016/g3gszf44 ↗Kurz gefasst
Fachartikel in der Zeitschrift Contributions to Discrete Mathematics, 2026. Verfasst von Jean-Luc Baril und 3 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-ND 4.0).
Abstract (Originalsprache)
Let $\mathcal{C}_n$ denote the set of Catalan words of length $n$ and $\mathcal{C}_n(p)$ the subset of $\mathcal{C}_n$ whose members avoid the pattern $p$. In this paper, we enumerate members of $\mathcal{C}_n(p)$ where $p$ is a permutation pattern of length four. This extends recent work on Catalan words concerning the avoidance of classical, consecutive or vincular patterns of length at most three. Indeed, we determine the generating function of the distribution for the number of descents on each of the corresponding avoidance classes. We make use of the symbolic counting method to establish our results, together with a variety of other enumerative techniques, including use of strategic decompositions, introduction of auxiliary generating functions and analysis of active sites.
Zitieren
APA
Baril, J., Mansour, T., Ramirez, J. L., & Shattuck, M. (2026). Catalan words avoiding a pattern of length four. Contributions to Discrete Mathematics. https://doi.org/10.55016/g3gszf44
Vancouver
Baril J, Mansour T, Ramirez JL, Shattuck M. Catalan words avoiding a pattern of length four. Contributions to Discrete Mathematics. 2026. doi:10.55016/g3gszf44
BibTeX
@article{Baril2026,
author = {Baril, Jean-Luc and Mansour, Toufik and Ramirez, Jose L. and Shattuck, Mark},
title = {Catalan words avoiding a pattern of length four},
journal = {Contributions to Discrete Mathematics},
year = {2026},
doi = {10.55016/g3gszf44}
}
EUVIMED