Pattern avoiding and q -decreasing binary words

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 gene...

Full description

Saved in:
Bibliographic Details
Published inRAIRO. Informatique théorique et applications Vol. 59; p. 13
Main Authors Barcucci, Elena, Bernini, Antonio, Bilotta, Stefano, Pinzani, Renzo
Format Journal Article
LanguageEnglish
Published 17.10.2025
Online AccessGet full text
ISSN0988-3754
2804-7346
2804-7346
DOI10.1051/ita/2025013

Cover

More Information
Summary: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 .
ISSN:0988-3754
2804-7346
2804-7346
DOI:10.1051/ita/2025013