Holey Hyperbolic Polyforms

Abstract

A polyform is a planar figure formed by gluing congruent regular polygons along entire edges. We study polyforms in hyperbolic $p,q$-tessellations and the extremal problem of minimizing the number of tiles needed to realize exactly $h$ holes. Denoting this minimum by $g_{p,q}(h)$, we establish general lower and upper bounds, compute exact values in several small cases, and give a sufficient structural condition for a polyform to have $h$ holes and $g_{p,q}(h)$ tiles.

5 figures, 7 tables