Counting $k$-Convex Polyominoes
Keywords:
Convex Polyominoes
Abstract
We compute an asymptotic estimate of a lower bound of the number of $k$-convex polyominoes of semiperimeter $p$. This approximation can be written as $\mu(k) p 4^p$ where $\mu(k)$ is a rational fraction of $k$ which up to $\mu(k)$ is the asymptotics of convex polyominoes.
Published
2013-06-13
How to Cite
Micheli, A., & Rossin, D. (2013). Counting $k$-Convex Polyominoes. The Electronic Journal of Combinatorics, 20(2), P56. https://doi.org/10.37236/3435
Article Number
P56