English

Polyominoes with maximal number of deep holes

Combinatorics 2026-01-13 v1 Optimization and Control

Abstract

In this paper, we study the extremal behaviour of deep holes in polyominoes. We determine the maximum number, hnh_n of deep holes that an nn-omino can enclose, ensuring that the boundary of each hole is disjoint from the boundaries of any other hole and from the outer boundary of the nn-tile. Using the versatile application of Pick's theorem, we establish the lower and the upper bound for hnh_n, and show that hn=n3+o(n)h_n=\frac{n}{3}+o(n) asymptotically. To further develop these results, we compute hnh_n as a function of nn for an infinite subset of positive integers.

Keywords

Cite

@article{arxiv.2601.06840,
  title  = {Polyominoes with maximal number of deep holes},
  author = {Djordje Baralic and Shiven Uppal},
  journal= {arXiv preprint arXiv:2601.06840},
  year   = {2026}
}