The number of convex permutominoes

Permutominoes are polyominoes defined by suitable pairs of permutations. In this paper we provide a formula to count the number of convex permutominoes of given perimeter. To this aim we define the transform of a generic pair of permutations, we characterize the transform of any pair defining a convex permutomino, and we solve the counting problem in the transformed space.

• Type: Journal
• Year: 2008
• Where: IANDC
• Authors: Paolo Boldi, Violetta Lonati, Roberto Radicioni, Massimo Santini
• Keywords: Generic Pair, IANDC 2008, Permutations, Suitable Pairs