On the exhaustive generation of convex permutominoes

zbMATH Open1224.05008arXiv0810.2883MaRDI QIDQ3077347FDOQ3077347

Authors: Elisabetta Grazzini, E. Pergola, Maddalena Poneti 

Publication date: 22 February 2011

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.

Full work available at URL: https://arxiv.org/abs/0810.2883

Recommendations

• The combinatorics of convex permutominoes
• Characterization and enumeration of some classes of permutominoes
• Permutations defining convex permutominoes
• Polyominoes determined by permutations
• The number of convex permutominoes

zbMATH Keywords

generation of convex permutominoes

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Polyominoes (05B50)

Cited In (5)

• A closed formula for the number of convex permutominoes
• Constructive (2,3)-generation: A permutational approach
• On the exhaustive generation of \(k\)-convex polyominoes
• On the enumeration of permutominoes
• Reconstructing convex permutominoes

This page was built for publication: On the exhaustive generation of convex permutominoes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3077347)