A closed formula for the number of convex permutominoes (Q1010614): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0702550 / rank | |||
Normal rank |
Latest revision as of 19:40, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A closed formula for the number of convex permutominoes |
scientific article |
Statements
A closed formula for the number of convex permutominoes (English)
0 references
7 April 2009
0 references
Summary: 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.
0 references
number of convex permutominoes
0 references
recursive generation
0 references
Enumeration of Combinatorial Objects
0 references
ECO method
0 references