7 citations · 13 across the 10 of their papers we have counts for
12 papers
Random Generation of -coloured Motzkin Paths
Elena Barcucci, Antonio Bernini, Stefano Bilotta +1
We study k-coloured Motzkin paths, namely Motzkin paths in which horizontal steps can be coloured in k different ways, and investigate their connection with the number of prefixes…
Rational Dyck paths
Elena Barcucci, Antonio Bernini, Stefano Bilotta +1
Given a positive rational , we consider Dyck paths having height at most two with some constraints on the number of consecutive peaks and consecutive valleys, depending on .…
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…
Restricting Dyck Paths and 312-avoiding Permutations
Elena Barcucci, Antonio Bernini, Stefano Bilotta +1
Dyck paths having height at most and without valleys at height are combinatorially interpreted by means of 312-avoding permutations with some restrictions on their \emph{…
Strings from linear recurrences and permutations: a Gray code
Elena Barcucci, Antonio Bernini, Renzo Pinzani
Each positive increasing integer sequence can serve as a numeration system to represent each non-negative integer by means of suitable coefficient strings. We a…
A Construction for Variable Dimension Strong Non-Overlapping Matrices
Elena Barcucci, Antonio Bernini, Stefano Bilotta +1
We propose a method for the construction of sets of variable dimension strong non-overlapping matrices basing on any strong non-overlapping set of strings.