13 citations · 28 across the 19 of their papers we have counts for
8 papers · 1 filter
The mex statistic on combinatorial structures
Antonio Bernini, Stefano Bilotta, Giulio Cerbai +1
We extend the notion of mex, which is central in combinatorial number theory, to an arbitrary combinatorial structure, and we prove a general theorem to determine the generating fu…
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 .…
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{…
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.
Non-overlapping Dyck matrices
Elena Barcucci, Antonio Bernini, Stefano Bilotta +2
We define a set of binary matrices where any two of them can not be placed one on the other in a way such that the corresponding entries coincide. The rows of the matrices are obta…
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…