Permutations defining convex permutominoes

Abstract

A permutomino of size n is a polyomino determined by particular pairs (P1, P2) of permutations of size n, such that P1(i) is different from P2(i), for all i. Here we determine the combinatorial properties and, in particular, the characterization for the permutations defining convex permutominoes. Using such a characterization, these permutations can be uniquely represented in terms of the so called square permutations, introduced by Mansour and Severini. Then, we provide a closed formula for the number of these permutations with size n.