Pattern avoiding and q-decreasing binary words

DOI10.1051/ITA/2025013MaRDI QIDQ6908472zbMATH OpenFDO

Authors Elena Barcucci, Antonio Bernini, S. Bilotta, R. Pinzani

Publication date 31 October 2025

Published in RAIRO. Theoretical Informatics and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/ITA/2025013

zbMATH Keywords

Dyck pathscombinatorial interpretationnumber sequences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorics on words (68R15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cites work

• scientific article; zbMATH DE number 1665457 (Why is no real title available?)
• scientific article; zbMATH DE number 7676362 (Why is no real title available?)
• Catalan Numbers
• Dyck paths enumerated by the \(\mathbb{Q}\)-bonacci numbers
• Exhaustive generation of some lattice paths and their prefixes
• Gray codes for Fibonacci \(q\)-decreasing words
• Rational Dyck paths
• Sequences from Fibonacci to Catalan: A combinatorial interpretation via Dyck paths

This page was built for publication: Pattern avoiding and \(q\)-decreasing binary words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6908472)