OpenAlex ·

Towards Strongly Aperiodic Monotiles in Higher Dimensions

Dmitry Kamenetsky

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2610.00916
Original
Read it at the publisher
Topics
Materials ScienceComputational ComplexityMathematical Physics

Abstract

The discovery of Chair44 (Tsiokos, 2026) settled the three-dimensional einstein problem with a strongly aperiodic polyhedral monotile in $\mathbb{R}^3$. This note extends the underlying mechanism---the rep-$2^N$ chair $C_N = [0,2]^N \setminus (1,2]^N$ with corner/socket markings---to $\mathbb{R}^N$. Besides expository material (the rep-$2^N$ dissection and a conditional strong-aperiodicity theorem under lattice registration and hierarchical enforcement), the note makes a new computational contribution. We introduce a frame-marking formalism in which the marking of a tile is its full orientation frame and the matching rule is the contact language generated by the substitution itself; this makes the search for matching rules finite in every dimension. We give a finite certificate (coarsening closure, tightness, and a two-shell enclosure analysis) whose validity implies that every lattice-registered tiling by the marked tile is uniquely hierarchical, hence strongly aperiodic. For $N=3$ the certificate passes: it yields explicit facet matching rules on the 24 panels of $C_3$ (135 admissible facet-contact triples) and reproduces, from first principles and independently of published constructions, the Chair44 statistics 2388 $\to$ 44 admissible contacts (30 occurring), 33 one-shell clusters, 15 extendable, each forcing a unique supertile. Among the 2187 homochiral frame assignments of the 3D substitution with a translated central child, the certified one is unique up to conjugation. For $N=4$ the same pipeline is run on several structured families of frame assignments (canonical, $D_4$-, $Z_2\times Z_2$- and $Z_4$-symmetric, and a lift of the 3D solution); none is coarsening-closed, and we report the failure data. A self-similar marking of $C_4$ thus remains an explicitly finite, open computational problem, which we state precisely. Code: https://github.com/dimkadimon/Monotile-RN

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Materials Science

Get the few papers worth your time in Materials Science every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics