A closed formula for the number of convex permutominoes

Simple item page
dc.creatorDisanto, Filippo
dc.creatorFrosini, Andrea
dc.creatorPinzani, Renzo
dc.creatorRinaldi, Simone
dc.date2007-02-19
dc.date.accessioned2026-07-07T08:40:20Z
dc.date.available2026-07-07T08:40:20Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/math/0702550
dc.identifierhttp://arxiv.org/abs/math/0702550
dc.identifierEl. J. Combinatorics 14 (2007) #R57
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/141343
dc.subjectCombinatorics
dc.subject05A15, 05A05
dc.titleA closed formula for the number of convex permutominoes
dc.typetext

Files

Collections

arXiv