On the exhaustive generation of convex permutominoes

2008/10/16 by Grazzini, Elisabetta, Pergola, Elisa, Poneti, Maddalena
#05A05 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.0810.2883

Abstract

A permutomino of size n is a polyomino determined by a pair of permutations of size n+1, such that they differ in each position. In this paper, after recalling some enumerative results about permutominoes, we give a first algorithm for the exhaustive generation of a particular class of permutominoes, the convex permutominoes, proving that its cost is proportional to the number of generated objects.

Related

• Permutations defining convex permutominoes
• Six bijections between deco polyominoes and permutations
• Enumeration of polyominoes defined in terms of pattern avoidance or convexity constraints
• The number of directed k-convex polyominoes
• The number of Z-convex polyominoes