Polyominoes with maximal number of deep holes

Abstract

In this paper, we study the extremal behaviour of deep holes in polyominoes. We determine the maximum number, hn of deep holes that an n-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 n-tile. Using the versatile application of Pick's theorem, we establish the lower and the upper bound for hn, and show that hn=n3+o(n) asymptotically. To further develop these results, we compute hn as a function of n for an infinite subset of positive integers.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…