Related papers: Algorithms for translational tiling
A longstanding open problem asks for an aperiodic monotile, also known as an "einstein": a shape that admits tilings of the plane, but never periodic tilings. We answer this problem for topological disk tiles by exhibiting a continuum of…
In this work, we study the number of finite tiles $A\subset\mathbb{Z}^{d}$ of size $\alpha$ that translationally tile a finite $C\subset\mathbb{Z}^{d}$. We consider two tiles $A$ and $A'$ to be congruent if and only if one can be…
This paper characterizes when an $m \times n$ rectangle, where $m$ and $n$ are integers, can be tiled (exactly packed) by squares where each has an integer side length of at least 2. In particular, we prove that tiling is always possible…
We construct the first aperiodic tiles for two amenable 3-dimensional Lie groups: Sol and the Heisenberg group. Our construction relies on the use of higher-dimensional uniformly finite homology. In particular, we settle completely the…
We introduce the idea that the P vs NP problem can have a finer structure. Given the NP complete problem of interest, the configurations space of the problem can be divided in (at least) two regions. In one region, polynomial algorithms to…
We give a constructive method that can decrease the number of prototiles needed to tile a space. We achieve this by exchanging edge to edge matching rules for a small atlas of permitted patches. This method is illustrated with Wang tiles,…
There are two objectives to this work: to classify all tame integer tilings and to classify all tame integer hypertilings. Motivation for the first objective comes from Conway and Coxeter's modelling of positive integer friezes using…
We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…
We briefly review the standard methods used to construct quasiperiodic tilings, such as the projection, the inflation, and the grid method. A number of sample Mathematica programs, implementing the different approaches for one- and…
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…
Mining and exploring databases should provide users with knowledge and new insights. Tiles of data strive to unveil true underlying structure and distinguish valuable information from various kinds of noise. We propose a novel Boolean…
A perfect $H$-tiling in a graph $G$ is a collection of vertex-disjoint copies of a graph $H$ in $G$ that covers all vertices of $G$. Motivated by papers of Bush and Zhao and of Balogh, Treglown, and Wagner, we determine the threshold for…
This is a chapter surveying the current state of our understanding of tilings with infinite local complexity. It is intended to appear in the volume {\em Directions in Aperiodic Order}, D. Lenz, J. Kellendonk, and J. Savienen, eds.
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,…
This paper studies random lozenge tilings of general non-convex polygonal regions. We show that the pairwise interaction of the non-convexities leads asymptotically to new kernels and thus to new statistics for the tiling fluctuations. The…
We show that if $\mathbb Z^3$ can be tiled by translated copies of a set $F\subseteq\mathbb Z^3$ of cardinality the square of a prime then there is a weakly periodic $F$-tiling of $\mathbb Z^3$, that is, there is a tiling $T$ of $\mathbb…
Can the entire plane be paved with a single tile that forces aperiodicity? This is known as the ein Stein problem (in German, ein Stein means one tile). This paper presents an aperiodic monotile for the tiler. It is based on the monotile…
We give a short combinatorial proof of the classical pointwise ergodic theorem for probability measure preserving $\mathbb{Z}$-actions. Our approach reduces the theorem to a tiling problem: tightly tile each orbit by intervals with desired…
A tiling is a decomposition of a polygon into finitely many non-overlapping triangles. We prove that if a regular n-gon, $n \geq 5$, $n \neq 28$, can be tiled with similar right triangles, then one of the angles of these triangles is in…
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…