Permutations defining convex permutominoes

Details Permutations defining convex permutominoes Permutations defining convex permutominoes

2007-11-05

arxiv.org/abs/0711.0582v1

Mathematics

Combinatorics

Scientific paper

A permutomino of size n is a polyomino determined by particular pairs (P1, P2) of permutations of size n, such that P1(i) is different from P2(i), for all i. Here we determine the combinatorial properties and, in particular, the characterization for the permutations defining convex permutominoes. Using such a characterization, these permutations can be uniquely represented in terms of the so called square permutations, introduced by Mansour and Severini. Then, we provide a closed formula for the number of these permutations with size n.

Affiliated with

Also associated with

No associations

Rating

Permutations defining convex permutominoes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Permutations defining convex permutominoes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Permutations defining convex permutominoes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-659808