A closed formula for the number of convex permutominoes (Q1010614)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5540835
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A closed formula for the number of convex permutominoes |
scientific article; zbMATH DE number 5540835 |
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
0.8834217190742493
0 references
0.8692715764045715
0 references
0.8666399121284485
0 references
0.8585589528083801
0 references
0.8443276286125183
0 references
