[Paper Review] Hexagonal parquet tilings: k-isohedral monotiles with arbitrarily large k

Joshua E. S. Socolar|ArXiv.org|Aug 20, 2007

Quasicrystal Structures and Properties10 references4 citations

TL;DR

This paper constructs a family of monotiles—single tiles with local matching rules—that force hexagonal parquet tilings with arbitrarily large isohedral numbers (k). By varying tile shape, edge coloring, or density-maximization rules, the authors demonstrate that k-isohedral monotiles exist for any k, resolving a long-standing question in tiling theory through geometric and topological design in 2D and 3D.

ABSTRACT

This paper addresses the question of whether a single tile with nearest neighbor matching rules can force a tiling in which the tiles fall into a large number of isohedral classes. A single tile is exhibited that can fill the Euclidean plane only with a tiling that contains k distinct isohedral sets of tiles, where k can be made arbitrarily large. It is shown that the construction cannot work for a simply connected 2D tile with matching rules for adjacent tiles enforced by shape alone. It is also shown that any of the following modifications allows the construction to work: (1) coloring the edges of the tiling and imposing rules on which colors can touch; (2) allowing the tile to be multiply connected; (3) requiring maximum density rather than space-filling; (4) allowing the tile to have a thickness in the third dimension.

Motivation & Objective

• To resolve the open problem of whether k-isohedral monotiles exist for arbitrarily large k.
• To explore how different local matching rules—such as edge coloring, shape connectivity, or density maximization—affect global tiling structure.
• To demonstrate that the isohedral number of a tiling can be made arbitrarily large using a single tile with carefully designed constraints.
• To clarify the distinction between different formulations of the tiling problem, particularly regarding space-filling, connectivity, and rule types.
• To provide constructive examples of monotiles that enforce non-periodic, high-symmetry tilings through local rules alone.

Proposed method

• Designing a hexagonal parquet tiling structure composed of L×L clusters of monotiles, where L controls the isohedral number.
• Using edge coloring with matching rules to enforce tiling order without requiring space-filling, enabling arbitrarily large k.
• Creating multiply connected monotiles (e.g., with interlocking grooves) that become simply connected when assembled, ensuring global structure via shape alone.
• Employing a maximum density rule in 2D, where the tile’s shape forces the hexagonal parquet as the densest possible tiling.
• Extending constructions to 3D by using layered, interlocking tiles that enforce stacking with incommensurate rotations, enabling non-periodic tilings.
• Proving that satisfying local constraints (e.g., fitting into notches) guarantees maximum density, thus enforcing the desired global structure.

Experimental results

Research questions

• RQ1 Can a single tile (monotile) force a tiling with an isohedral number k that is arbitrarily large?
• RQ2 How do different types of local matching rules—coloring, shape, or density maximization—affect the global symmetry and isohedral number of a tiling?
• RQ3 Is it possible to construct a simply connected monotile in 2D that enforces a non-periodic tiling using only shape-based rules?
• RQ4 What is the relationship between maximum density constraints and the emergence of complex global tiling structures?
• RQ5 Can 3D topological design overcome the limitations of 2D in constructing monotiles with high isohedral numbers using shape-only rules?

Key findings

• The isohedral number of the hexagonal parquet tiling can be made arbitrarily large by increasing the aspect ratio of the monotile, with k scaling with L, the number of tiles per rhombus.
• A 3D monotile can be constructed as a simply connected shape whose interlocking grooves and bumps enforce a double-layered hexagonal parquet via shape alone, a feat impossible in 2D.
• A 2D monotile with bumps and notches can enforce the hexagonal parquet as the unique maximum-density tiling, proving that local fitting minimizes excluded area.
• Edge coloring rules can enforce the same tiling structure while allowing for arbitrarily large k, demonstrating that color matching is sufficient to achieve high isohedral numbers.
• The construction shows that the precise formulation of the tiling problem—e.g., space-filling vs. maximum density—significantly affects the existence and nature of monotiles.
• The results suggest that maximum density constraints can act as effective global rules that enforce complex, non-periodic structures from local interactions alone.