Name
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 ECHO 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. |
Year | Venue | Keywords |
|---|---|---|
2007 | ELECTRONIC JOURNAL OF COMBINATORICS | functional equation,generating function |
Field | DocType | Volume |
Discrete mathematics,Generating function,Combinatorics,Convex combination,Polyomino,Regular polygon,Proper convex function,Functional equation,Convex analysis,Recursion,Mathematics | Journal | 14.0 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 6 |
PageRank | References | Authors |
0.91 | 11 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Filippo Disanto | 1 | 22 | 6.60 |
| Andrea Frosini | 2 | 101 | 20.44 |
| Renzo Pinzani | 3 | 341 | 67.45 |
| Simone Rinaldi | 4 | 174 | 24.93 |