13 citations · 34 across the 27 of their papers we have counts for
7 papers · 1 filter
Dyck Paths Enumerated by the Q-bonacci Numbers
Elena Barcucci, Antonio Bernini, Stefano Bilotta +1
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…
Non-overlapping matrices
Elena Barcucci, Antonio Bernini, Stefano Bilotta +1
Two matrices are said non-overlapping if one of them can not be put on the other one in a way such that the corresponding entries coincide. We provide a set of non-overlapping bina…
Cross-bifix-free sets in two dimensions
Elena Barcucci, Antonio Bernini, Stefano Bilotta +1
A bidimensional bifix (in short bibifix) of a square matrix T is a square submatrix of T which occurs in the top-left and bottom-right corners of T. This allows us to extend the de…
Recurrence relations versus succession rules
Stefano Bilotta, Elisa Pergola, Renzo Pinzani +1
In this paper we present a method to pass from a recurrence relation having constant coefficients (in short, a C-recurrence) to a finite succession rule defining the same number se…
Generation of binary words avoiding alternating patterns
Stefano Bilotta, Elisabetta Grazzini, Elisa Pergola +1
In this paper we propose an algorithm to generate binary words with no more 0's than 1's having a fixed number of 1's and avoiding the pattern for any fixed . W…
Binary words avoiding a pattern and marked succession rule
Stefano Bilotta, Donatella Merlini, Elisa Pergola +1
In this paper we study the enumeration and the construction of particular binary words avoiding the pattern . By means of the theory of Riordan arrays, we solve the enu…