.png){kind=icon}
.png){kind=icon}
Return
Pattern avoiding and q-decreasing binary words
.png){kind=icon}
OA
AI
DOI：10.1051/ita/2025013.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We provide a bijection between the set of the q-decreasing binary words (in the case where q is an irreducible positive rational number) and a set of binary words avoiding some patterns whose lengths depends on the number q. Moreover, for such a set we give the details of the construction, the generating function according to the length of its words, and the recurrence relation of the enumerating sequence, depending on q.
Keywords:
Dyck paths
number sequences
combinatorial interpretation
Journal
R
IF:
0.5
Papers:
23
Citations:
0