An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
On the combinatorial invariance of Kazhdan-Lusztig polynomials
Journal of Combinatorial Theory Series A
Polygons Drawn from Permutations
Fundamenta Informaticae - Strategies for Tomography
Hi-index | 0.00 |
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.