The number of convex permutominoes

13 years 4 months ago

Download homes.dsi.unimi.it

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.

Paolo Boldi, Violetta Lonati, Roberto Radicioni, M

Real-time Traffic

Generic Pair | IANDC 2008 | Permutations | Suitable Pairs |

claim paper

» On the Hull Number of TriangleFree Graphs

» The number of lines tangent to arbitrary convex polyhedra in 3D

» On the Reflexivity of Point Sets

» Piercing Translates and Homothets of a Convex Body

» Convex Polyhedra Realizing Given Face Areas

» SelfConcordant Barriers for Convex Approximations of Structured Convex Sets

» Optimal BSR Solutions to Several Convex Polygon Problems

» Neighbor number valley seeking and clustering

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	IANDC
Authors	Paolo Boldi, Violetta Lonati, Roberto Radicioni, Massimo Santini

Comments (0)

Sciweavers

The number of convex permutominoes

Generic Pair | IANDC 2008 | Permutations | Suitable Pairs |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers