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.
@article{10_37236_3435,
author = {Anne Micheli and Dominique Rossin},
title = {Counting \(k\)-convex polyominoes},
journal = {The electronic journal of combinatorics},
year = {2013},
volume = {20},
number = {2},
doi = {10.37236/3435},
zbl = {1295.05019},
url = {http://geodesic.mathdoc.fr/articles/10.37236/3435/}
}
TY - JOUR
AU - Anne Micheli
AU - Dominique Rossin
TI - Counting \(k\)-convex polyominoes
JO - The electronic journal of combinatorics
PY - 2013
VL - 20
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/3435/
DO - 10.37236/3435
ID - 10_37236_3435
ER -