DeepAI AI Chat
Log In Sign Up

Catalan words avoiding pairs of length three patterns

by   Jean-Luc Baril, et al.
Université de Bourgogne

Catalan words are particular growth-restricted words counted by the eponymous integer sequence. In this article we consider Catalan words avoiding a pair of patterns of length 3, pursuing the recent initiating work of the first and last authors and of S. Kirgizov where (among other things) the enumeration of Catalan words avoiding a patterns of length 3 is completed. More precisely, we explore systematically the structural properties of the sets of words under consideration and give enumerating results by means of recursive decomposition, constructive bijections or bivariate generating functions with respect to the length and descent number. Some of the obtained enumerating sequences are known, and thus the corresponding results establish new combinatorial interpretations for them.


page 1

page 2

page 3

page 4


Descent distribution on Catalan words avoiding a pattern of length at most three

Catalan words are particular growth-restricted words over the set of non...

Polyominoes and graphs built from Fibonacci words

We introduce the k-bonacci polyominoes, a new family of polyominoes asso...

Exhaustive generation for permutations avoiding a (colored) regular sets of patterns

Despite the fact that the field of pattern avoiding permutations has bee...

Natural bijections for contiguous pattern avoidance in words

Two words p and q are avoided by the same number of length-n words, for ...

On 120-avoiding inversion and ascent sequences

Recently, Yan and the first named author investigated systematically the...

Refined Wilf-equivalences by Comtet statistics

We launch a systematic study of the refined Wilf-equivalences by the sta...

Catalan and Schröder permutations sortable by two restricted stacks

We investigate the permutation sorting problem with two restricted stack...