4 citations · 12 across the 13 of their papers we have counts for
13 papers
An Identity for Catalan Numbers via Restricted Dyck Paths
Antonio Bernini, Stefano Bilotta, Elisa Pergola
Catalan numbers and their interpretations in terms of Dyck paths are widely used in different topics of applied mathematics and computer science. Here, we consider a general approa…
A study on the fixed points of the function
Andrea Frosini, Giulia Palma, Elisa Pergola +1
Recently a permutation on Dyck paths, related to the chip firing game, was introduced and studied by Barnabei et al.. It is called -operator, and uses symmetries and reflections…
Cross-bifix-free sets via Motzkin paths generation
Elena Barcucci, Stefano Bilotta, Elisa Pergola +2
Cross-bifix-free sets are sets of words such that no prefix of any word is a sufix of any other word. In this paper, we introduce a general constructive method for the sets of cros…
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…
A new approach to cross-bifix-free sets
Stefano Bilotta, Elisa Pergola, Renzo Pinzani
Cross-bifix-free sets are sets of words such that no prefix of any word is a suffix of any other word. In this paper, we introduce a general constructive method for the sets of cro…