Work

Dyck Paths Enumerated by the Q-bonacci Numbers

Year: 2024

Type: article

Abstract: We consider Dyck paths having height at most two with some constraints on the number of consecutive valleys at height one which must be followed by a suitable number of valleys at height zero. We prove that they are enumerated by so-called Q-bonacci numbers (recently introduced by Kirgizov) which generalize the classical q-bonacci numbers in the case where q is a positive rational.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.403.13

Authors: Elena Barcucci, Antonio Bernini, Stefano Bilotta, Renzo Pinzani

Institution: University of Florence

Language: English

Topic: Advanced Combinatorial Mathematics

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: diamond

Funders: Istituto Nazionale di Alta Matematica "Francesco Severi", Gruppo Nazionale per il Calcolo Scientifico

Awards: G2020143847, G2236812494, G5339074417, G5456286744