Descent distribution on Catalan words avoiding ordered pairs of Relations
Combinatorics
2023-02-27 v1
Abstract
This work is a continuation of some recent articles presenting enumerative results for Catalan words avoiding one or a pair of consecutive or classical patterns of length . More precisely, we provide systematically the bivariate generating function for the number of Catalan words avoiding a given pair of relations with respect to the length and the number of descents. We also present several constructive bijections preserving the number of descents. As a byproduct, we deduce the generating function for the total number of descents on all Catalan words of a given length and avoiding a pair of ordered relations.
Cite
@article{arxiv.2302.12741,
title = {Descent distribution on Catalan words avoiding ordered pairs of Relations},
author = {Jean-Luc Baril and José Luis Ramírez},
journal= {arXiv preprint arXiv:2302.12741},
year = {2023}
}