Related papers: Forcing nonperiodic tilings with one tile using a …

This article, written for undergraduate mathematics students, provides an accessible introduction to a few key problems in tiling theory: Heesch's problem, the isohedral number problem, and the existence of an aperiodic monotile. I…

We study a family of substitution tilings with similar right triangles of two sizes which is obtained using the substitution rule introduced in [Danzer, L. and van Ophuysen, G. A species of planar triangular tilings with inflation factor…

We give a set of tiles that enforces the sphinx tiling substitution system; the tiles are thus aperiodic.

An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics ranging from logic (the Entscheidungsproblem) to physics…

We consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds…

Non-periodic tilings with Tile(1, 1) using the substitution method, as presented by Smith et al. in [2] and [3], can be converted into non-periodic tilings with three types of pentagons. When arbitrary replacements are excluded, the…

This paper presents a tileset of 3 squares with local constraints on their borders and corners that enforce non-periodic tiling. We start with a description of the tileset and we demonstrate that it can tile the entire plane…

We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…

In this thesis we will present and discuss various results pertaining to tiling problems and mathematical logic, specifically computability theory. We focus on Wang prototiles, as defined in [32]. We begin by studying Domino Problems, and…

We develop the basic and new tools for classifying non-side-to-side tilings of the sphere by congruent triangles. Then we prove that, if the triangle has any irrational angle in degree, such tilings are: a sequence of 1-parameter families…

We present a construction of a family of non-periodic tilings using elementary tools such as modular arithmetic and vector geometry. These tilings exhibit a distinct type of structural regularity, which we term modulo-staggered rotational…

The classical Domino problem asks whether there exists a tiling in which none of the forbidden patterns given as input appear. In this paper, we consider the aperiodic version of the Domino problem: given as input a family of forbidden…

We present here an elementary construction of an aperiodic tile set. Although there already exist dozens of examples of aperiodic tile sets we believe this construction introduces an approach that is different enough to be interesting and…

A new method for constructing self-referential tilings of Euclidean space from a graph directed iterated function system, based on a combinatorial structure we call a pre-tree, is introduced. In the special case that we refer to as…

Aperiodic tilings are non-periodic tilings characterized by local constraints. They play a key role in the proof of the undecidability of the domino problem (1964) and naturally model quasicrystals (discovered in 1982). A central question…

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…

We show that the following problem is undecidable: given two polygonal prototiles, determine whether the plane can be tiled with rotated and translated copies of them. This improves a result of Demaine and Langerman [SoCG 2025], who showed…

The Wang tiling is a classical problem in combinatorics. A major theoretical question is to find a (small) set of tiles which tiles the plane only aperiodically. In this case, resulting tilings are rather restrictive. On the other hand,…

The Heesch problem 'grades' polygons that fail to tile the plane in terms of the number of layers (or corollas) of copies of it that can be formed around a central unit. We study the different topology of ' walls', which we define to be…

Ammann bars are formed by segments (decorations) on the tiles of a tiling such that forming straight lines with them while tiling forces non-periodicity. Only a few cases are known, starting with Robert Ammann's observations on Penrose…