A closed formula for the number of convex permutominoes
Combinatorics
2007-11-05 v1
Abstract
In this paper we determine a closed formula for the number of convex permutominoes of size n. We reach this goal by providing a recursive generation of all convex permutominoes of size n+1 from the objects of size n, according to the ECO method, and then translating this construction into a system of functional equations satisfied by the generating function of convex permutominoes. As a consequence we easily obtain also the enumeration of some classes of convex polyominoes, including stack and directed convex permutominoes.
Cite
@article{arxiv.math/0702550,
title = {A closed formula for the number of convex permutominoes},
author = {Filippo Disanto and Andrea Frosini and Renzo Pinzani and Simone Rinaldi},
journal= {arXiv preprint arXiv:math/0702550},
year = {2007}
}