5 citations · 7 across the 8 of their papers we have counts for
10 papers · 1 filter
The Möbius function of the consecutive pattern poset
Antonio Bernini, Luca Ferrari, Einar Steingrimsson
An occurrence of a consecutive permutation pattern in a permutation is a segment of consecutive letters of whose values appear in the same order of size as the letters…
On the enumeration of d-minimal permutations
Mathilde Bouvel, Luca Ferrari
We suggest an approach for the enumeration of minimal permutations having d descents which uses skew Young tableaux. We succeed in finding a general expression for the number of su…
Lattices of Paths: Representation Theory and Valuations
Luca Ferrari, Emanuele Munarini
We study some distributive lattices arising in the combinatorics of lattice paths. In particular, for the Dyck, Motzkin and Schroder lattices we describe the spectrum and we determ…
Catalan numbers and relations
Filippo Disanto, Luca Ferrari, Renzo Pinzani +1
We define the notion of a Catalan pair (which is a pair of binary relations (S,R) satisfying certain axioms) with the aim of giving a common language to most of the combinatorial i…
Mixed succession rules: the commutative case
Silvia Bacchelli, Luca Ferrari, Renzo Pinzani +1
We begin a systematic study of the enumerative combinatorics of mixed succession rules, which are succession rules such that, in the associated generating tree, the nodes are allow…
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…