What is the maximum number of holes enclosed by a $d$-dimensional polyomino built of $n$ tiles? Represent this number by $f_d(n)$. Recent results show that $f_2(n)/n$ converges to $1/2$. We prove that for all $d \geq 2$ we have $f_d(n)/n \to (d-1)/d$ as $n$ goes to infinity. We also construct polyominoes in $d$-dimensional tori with the maximal possible number of holes per tile. In our proofs, we use metaphors from error-correcting codes and dynamical systems.
@article{10_37236_10515,
author = {Greg Malen and Fedor Manin and \'Erika Rold\'an},
title = {High-dimensional holeyominoes},
journal = {The electronic journal of combinatorics},
year = {2022},
volume = {29},
number = {3},
doi = {10.37236/10515},
zbl = {1494.05021},
url = {http://geodesic.mathdoc.fr/articles/10.37236/10515/}
}
TY - JOUR
AU - Greg Malen
AU - Fedor Manin
AU - Érika Roldán
TI - High-dimensional holeyominoes
JO - The electronic journal of combinatorics
PY - 2022
VL - 29
IS - 3
UR - http://geodesic.mathdoc.fr/articles/10.37236/10515/
DO - 10.37236/10515
ID - 10_37236_10515
ER -