A permutominide is a set of cells in the plane satisfying special connectivity constraints and uniquely deﬁned by a pair of permutations. It naturally generalizes the concept of permutomino, recently investigated by several authors and from different points of view [1, 2, 4, 6, 7]. In this paper, using bijective methods, we determine the enumeration of various classes of convex permutominides, including, parallelogram, directed convex, convex, and row convex permutominides. As a corollary we have a bijective proof for the number of convex permutominoes, which was still an open problem.
|Titolo:||Polyominoes determined by permutations: enumeration via bijections|
|Citazione:||Disanto, F., Duchi, E., Pinzani, R., & Rinaldi, S. (2012). Polyominoes determined by permutations: enumeration via bijections. ANNALS OF COMBINATORICS, 16(1), 57-75.|
|Appare nelle tipologie:||1.1 Articolo in rivista|