5 citations · 5 across the 2 of their papers we have counts for
7 papers · 1 filter
Six bijections between deco polyominoes and permutations
Emeric Deutsch, Elisa Pergola, Renzo Pinzani
In this paper we establish six bijections between a particular class of polyominoes, called deco polyominoes, enumerated according to their directed height by n!, and permutations.…
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…
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…
A closed formula for the number of convex permutominoes
Filippo Disanto, Andrea Frosini, Renzo Pinzani +1
In this paper we determine a closed formula for the number of convex permutominoes of size n. We reach this goal by providing a recursive generation of all convex permutominoes of…
Catalan-like numbers and succession rules
Luca Ferrari, Renzo Pinzani
The ECO method and the theory of Catalan-like numbers introduced by Aigner seems two completely unrelated combinatorial settings. In this work we try to establish a bridge between…