Related papers: Local Rules for Computable Planar Tilings
We provide a definitive classification of all finite sets of regular polygons that admit a tiling of the hyperbolic plane, thereby establishing the decidability of the Domino Problem for this class of prototiles. We show that admissibility…
A new method for constructing aperiodic tilings is presented. The method is illustrated by constructing a particular tiling and its hull. The properties of this tiling and the hull are studied. In particular it is shown that these tilings…
One of the most fundamental problems in tiling theory is the domino problem: given a set of tiles and tiling rules, decide if there exists a way to tile the plane using copies of tiles and following their rules. The problem is known to be…
We study decision problems on geometric tilings. First, we study a variant of the Domino problem where square tiles are replaced by geometric tiles of arbitrary shape. We show that this variant is undecidable regardless of the shapes,…
Given a periodic placement of copies of a tromino (either L or I), we prove co-RE-completeness (and hence undecidability) of deciding whether it can be completed to a plane tiling. By contrast, the problem becomes decidable if the initial…
In this paper we study algorithms for tiling problems. We show that the conditions $(T1)$ and $(T2)$ of Coven and Meyerowitz, conjectured to be necessary and sufficient for a finite set $A$ to tile the integers, can be checked in time…
How many different tiles are needed at the minimum to create aperiodicity? Several tilings made of two tiles were discovered, the first one being by Penrose in the seventies. Since then, scientists discovered other aperiodic tilings made of…
We introduce a new type of aperiodic hexagonal monotile; a prototile that admits infinitely many tilings of the plane, but any such tiling lacks any translational symmetry. Adding a copy of our monotile to a patch of tiles must satisfy two…
The periodic tiling conjecture asserts that if a region $\Sigma\subset \mathbb R^d$ tiles $\mathbb R^d$ by translations then it admits at least one fully periodic tiling. This conjecture is known to hold in $\mathbb R$, and recently it was…
A linear subspace $E$ of $\mathbb{R}^n$ has colored local rules if there exists a finite set of decorated tiles whose tilings are digitizations of $E$. The local rules are weak if the digitizations can slightly wander around $E$. We prove…
The present paper is a new version of the arXiv paper revisiting the proof given in a previous paper of the author published in 2008 proving that the general tiling problem of the hyperbolic plane is undecidable by proving a slightly…
Model sets (or cut and project sets) provide a familiar and commonly used method of constructing and studying nonperiodic point sets. Here we extend this method to situations where the internal spaces are no longer Euclidean, but instead…
A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…
To understand an aperiodic tiling (or a quasicrystal modeled on an aperiodic tiling), we construct a space of similar tilings, on which the group of translations acts naturally. This space is then an (abstract) dynamical system. Dynamical…
This is a chapter in an incoming book on aperiodic order. We review results about the topology, the dynamics, and the combinatorics of aperiodically ordered tilings obtained with the tools of noncommutative geometry.
The translational tiling problem, dated back to Wang's domino problem in the 1960s, is one of the most representative undecidable problems in the field of discrete geometry and combinatorics. Ollinger initiated the study of the…
We give a necessary and sufficient condition on a $d$-dimensional affine subspace of $\mathbb{R}^n$ to be characterized by a finite set of patterns which are forbidden to appear in its digitization. This can also be stated in terms of local…
Translational tiling problems are among the most fundamental and representative undecidable problems in all fields of mathematics. Greenfeld and Tao obtained two remarkable results on the undecidability of translational tiling in recent…
Our understanding of physical properties of quasicrystals owes a great deal to studies of tight-binding models constructed on quasiperiodic tilings. Among the large number of possible quasiperiodic structures, two dimensional tilings are of…
In this paper, we prove that the general tiling problem of the hyperbolic plane is undecidable by proving a slightly stronger version using only a regular polygon as the basic shape of the tiles. The problem was raised by a paper of Raphael…