4 citations · 4 across the 3 of their papers we have counts for
6 papers
Enumeration of some classes of words avoiding two generalized patterns of length three
Antonio Bernini, Luca Ferrari, Renzo Pinzani
The method we have applied in "A. Bernini, L. Ferrari, R. Pinzani, Enumerating permutations avoiding three Babson-Steingrimsson patterns, Ann. Comb. 9 (2005), 137--162" to count pa…
Enumerating permutations avoiding more than three Babson - Steingr\'ımsson patterns
Antonio Bernini, Elisa Pergola
Not long ago, Claesson and Mansour proposed some conjectures about the enumeration of the permutations avoiding more than three Babson - Steingr\'ımsson patterns (generalized patte…
A general exhaustive generation algorithm for Gray structures
Antonio Bernini, Elisabetta Grazzini, Elisa Pergola +1
Starting from a succession rule for Catalan numbers, we define a procedure encoding and listing the objects enumerated by these numbers such that two consecutive codes of the list…
An exhaustive generation algorithm for Catalan objects and others
Antonio Bernini, Irene Fanti, Elisabetta Grazzini
In this paper we present a CAT generation algorithm for Dyck paths with a fixed length n. It is the formalization of a method for the exhaustive generation of this kind of paths wh…
From Fibonacci to Catalan permutations
E. Barcucci, A. Bernini, M. Poneti
It is well known that permutations avoiding any 3-length pattern are enumerated by the Catalan numbers. If the three patterns 123, 132 and 213 are avoided at the same time we obtai…
Some statistics on permutations avoiding generalized patterns
A. Bernini, m. Bouvel, L. Ferrari
In the last decade a huge amount of articles has been published studying pattern avoidance on permutations. From the point of view of enumeration, typically one tries to count perm…