| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 426263 | Information and Computation | 2008 | 10 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
