Permutomino

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search

A permutomino is a member of a class of polyominoes that are defined using a pair of permutations of size n+1, where n is the width and height of the bounding box of the permutomino.

The number of convex permutominoes of size n for the first 10 n is

n Number of
convex
permutominoes
1 1
2 4
3 18
4 84
5 394
6 1,836
7 8,468
8 38,632
9 174,426
10 780,156

The 2x2 permutominoes

[edit]

There are 4 convex permutominoes of order 2 (shown in green).

The clockwise 3x3 permutominoes

[edit]

There are 18 convex and 8 concave order-3 polyominoes (shown in green).

References

[edit]
  • I. Fanti; A. Frosini, E. Grazzini, R. Pinzani, S. Rinaldi (August, 2006). Polyominoes determined by permutations (pdf). Discrete Mathematics & Theoretical Computer Science Proceedings. Archived from the original on 2006-11-24. Retrieved on 2008-09-08.
  • Paolo Boldi; Violetta Lonati, Roberto Radicioni, Massimo Santini (November 29, 2006). The number of convex permutominoes (pdf). Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano.[dead link]