Topology and Geometry of Crystallized Polyominoes

Abstract: We give a complete solution to the extremal topological combinatorial problem of finding the minimum number of tiles needed to construct a polyomino with $h$ holes. We denote this number by $g(h)$ and say that a polyomino is crystallized if it has $h$ holes and $g(h)$ tiles. We analyze structural properties of crystallized polyominoes and characterize their efficiency by a topological isoperimetric inequality that relates minimum perimeter, the area of the holes, and the structure of the dual graph of a polyomino. We also develop a new dynamical method of creating sequences of polyominoes which is invariant with respect to crystallization and efficient structure. Using this technique, we prove that crystallized polyominoes with $h_l=(2^{2l}-1)/3$ holes are unique.

• The paper introduces explicit and recursive formulae for g(h) that determine the minimal number of tiles required for a polyomino with h holes.
• It extends classical perimeter minimization by formulating a topological isoperimetric inequality applicable to polyominoes with holes.
• Crystallized polyominoes are characterized by efficient structures, acyclic dual graphs, and unique configurations for specific hole counts.

Extremal Topology and Structural Characterization of Crystallized Polyominoes

Problem Overview

The paper addresses the extremal combinatorial-topological problem of determining the minimum number of unit square tiles, denoted $g(h)$, required to construct a polyomino with $h$ holes. A polyomino is a finite, edge-connected union of closed unit squares on the plane. A "hole" is defined as a bounded connected component of the complement of the polyomino. A polyomino achieving $g(h)$ is termed "crystallized." The authors' investigation provides a complete resolution of the extremal values of $g(h)$ for all $h \geq 1$, delivers a structural characterization of crystallized polyominoes, and identifies situations where these objects realize specific geometric and topological constraints.

Main Results

The paper introduces explicit and recursive formulae for $g(h)$, leveraging both isoperimetric and enumerative techniques. Key results comprise:

1. Determination of $g(h)$ for all $h$: Using a combination of isoperimetric inequalities, recursive expansions, compression techniques, and combinatorial constructions, the authors give all values of $g(h)$ and identify the parameter regimes where these values can be explicitly matched to compact arrangements in squares or pronic rectangles.
2. Topological Isoperimetric Inequality (TII): The classical perimeter minimization in simply connected polyominoes is generalized to polyominoes with $h$ holes, showing that the minimal achievable outer perimeter is $2\lceil 2\sqrt{n + h} \rceil$ for a polyomino with $n$ tiles and $h$ holes.
3. Efficient Structure Characterization: Crystallized polyominoes (in almost all cases) can be described as efficiently structured, i.e., with acyclic dual graphs, all holes of area one, and minimal outer perimeter. Exceptions are fully classified and shown to be rare and finite in number for a given $h$.
4. Uniqueness Phenomena: For the sequence $h_l = (2^{2l} - 1)/3$, the paper proves that the so-called K–R sequence (constructed in prior work) yields the unique crystallized polyomino up to symmetry.

Theoretical Foundations

The authors develop a topological isoperimetric framework generalizing the result of Harary and Harborth (1976) for perimeter minimization. They define a function $M(n, h)$ encoding the perimeter/tiles/holes tradeoff and show that for efficiently structured polyominoes, $h = M(n, h)$, with $n = g(h)$. The minimal tile/polyomino arrangements only possess holes of area one and acyclic dual graphs unless encountering exceptional obstructions due to perimeter/area quantization at certain integer thresholds.

The use of dual graphs (edge-adjacency) and hole graphs (corner-adjacency) underpins the connectedness and acyclicity constraints. These combinatorial invariants are leveraged to show that, aside from finitely many exceptional cases, extra tiles (beyond those needed to enclose holes with area one) would necessarily produce cycles in the dual graph, violating efficient structure, or cause holes of area greater than one, both of which cannot occur in crystallized polyominoes.

Construction and Existence Proofs

For specific classes of $h$, particularly values corresponding to $h_\alpha$ where $\alpha$ is a square or pronic number, explicit crystallized polyomino constructions are given. The authors use recursive expansion and compression methods that preserve acyclicity and minimal perimeter. The expansion process grows inner efficiently-structured arrangements into larger, self-similar crystallized polyominoes, while compression reduces complex arrangements down to base cases, culminating in the unique $h = 1$ crystallized polyomino.

Dismantling methods are also developed to show that starting from a maximal crystallized polyomino, holes (and associated tiles) can be removed in pairs to reach all smaller $h$, yielding the linear increments in the minimal tile sequence.

Enumerative and Uniqueness Aspects

The values of $g(h)$ for small $h$ (up to 8) are tabulated based on the complete enumeration by Olivera e Silva. The main enumerative result is for the K–R sequence, where, using recursive compression, the uniqueness of the crystallized polyomino is established for each $h_l = (2^{2l} - 1)/3$.

Implications and Future Directions

Practical and Theoretical Implications

• Combinatorial Topology: The methods and results provide a template for tackling extremal problems in other polyform classes (e.g., polyiamonds or in higher dimensions for cubical complexes).
• Algorithmic Applications: Explicit constructions and efficient dismantling algorithms have potential utility in the design of tiling and packing algorithms, or in image analysis of discrete objects with prescribed topological features.
• Homology and Higher Dimensions: The results suggest natural generalizations to maximizing homology ranks in higher-dimensional cubical complexes, where similar expansion and compression methods may inform optimal constructions for given Betti numbers.

Open Problems

Several enumerative problems remain unresolved, particularly for crystallized polyominoes with non-extremal or non-sequence values of $h$. The challenge of extending these results to higher homology or other polyform families, as well as strengthening the uniqueness results for broader classes, is articulated as key future work.

Conclusion

The paper provides a complete solution to the minimal tile problem for holes in polyominoes, establishes precise isoperimetric and combinatorial bounds, and delivers both construction methods and uniqueness proofs. The structural characterization deepens the understanding of the interplay between geometry, topology, and combinatorics in discrete tiling problems, laying a rigorous foundation for analogous extremal investigations in higher dimensions and other polyform classes (1910.10342).