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

03/18/2018
by   Jean-Luc Baril, et al.
0

Catalan words are particular growth-restricted words over the set of non-negative integers, and they represent still another combinatorial class counted by the Catalan numbers. We study the distribution of descents on the sets of Catalan words avoiding a pattern of length at most three: for each such a pattern p we provide a bivariate generating function where the coefficient of x^ny^k in its series expansion is the number of length n Catalan words with k descents and avoiding p. As a byproduct, we enumerate the set of Catalan words avoiding p, and we provide the popularity of descents on this set. Some of the obtained enumerating sequences are not yet recorded in the On-line Encyclopedia of Integer Sequences.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/22/2019

Catalan words avoiding pairs of length three patterns

Catalan words are particular growth-restricted words counted by the epon...
research
12/17/2022

Natural bijections for contiguous pattern avoidance in words

Two words p and q are avoided by the same number of length-n words, for ...
research
11/12/2019

Popularity of patterns over d-equivalence classes of words and permutations

Two same length words are d-equivalent if they have same descent set and...
research
07/23/2018

Enumerative Results on the Schröder Pattern Poset

The set of Schröder words (Schröder language) is endowed with a natural ...
research
04/03/2020

Catalan and Schröder permutations sortable by two restricted stacks

We investigate the permutation sorting problem with two restricted stack...
research
11/10/2022

Polyominoes and graphs built from Fibonacci words

We introduce the k-bonacci polyominoes, a new family of polyominoes asso...
research
10/03/2021

Words that almost commute

The Hamming distance ham(u,v) between two equal-length words u, v is the...

Please sign up or login with your details

Forgot password? Click here to reset