Related papers: Tiling the symmetric group by transpositions
A set is said to tile the integers if and only if the integers can be written as a disjoint union of translates of that set. We consider the problem of finding necessary and sufficient conditions for a finite set to tile the integers. For…
We prove that for any infinite countable amenable group $G$, any $\epsilon > 0$ and any finite subset $K\subset G$, there exists a tiling (partition of $G$ into finite "tiles" using only finitely many "shapes"), where all the tiles are $(K;…
The purpose of this paper is to investigate the properties of spectral and tiling subsets of cyclic groups, with an eye towards the spectral set conjecture in one dimension, which states that a bounded measurable subset of $\mathbb{R}$…
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…
Recently, Greenfeld and Tao disprove the conjecture that translational tilings of a single tile can always be periodic [Ann. Math. 200(2024), 301-363]. In another paper [to appear in J. Eur. Math. Soc.], they also show that if the dimension…
Is there a fixed dimension $n$ such that translational tiling of $\mathbb{Z}^n$ with a monotile is undecidable? Several recent results support a positive answer to this question. Greenfeld and Tao disprove the periodic tiling conjecture by…
In [B.Gruenbaum, G.C. Shephard, Spherical tilings with transitivity properties, in: The geometric vein, Springer, New York, 1981, pp. 65-98], they proved "for every spherical normal tiling by congruent tiles, if it is isohedral, then the…
A subset V of GF(2)^n is a tile if GF(2)^n can be covered by disjoint translates of V. In other words, V is a tile if and only if there is a subset A of GF(2)^n such that V+A = GF(2)^n uniquely (i.e., v + a = v' + a' implies that v=v' and…
We construct an example of a group $G = \mathbb{Z}^2 \times G_0$ for a finite abelian group $G_0$, a subset $E$ of $G_0$, and two finite subsets $F_1,F_2$ of $G$, such that it is undecidable in ZFC whether $\mathbb{Z}^2\times E$ can be…
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…
Let n integer greater or equal to 4 and even and let T_n be the set of ribbon L-shaped n-ominoes. We study tiling problems for regions in a square lattice by T_n. Our main result shows a remarkable rigidity property: a tiling of the first…
Motivated by applications in reliable and secure communication, we address the problem of tiling (or partitioning) a finite constellation in $\mathbb{Z}_{2^L}^n$ by subsets, in the case that the constellation does not possess an abelian…
This paper focuses on the undecidability of translational tiling of $n$-dimensional space $\mathbb{Z}^n$ with a set of $k$ tiles. It is known that tiling $\mathbb{Z}^2$ with translated copies with a set of $8$ tiles is undecidable.…
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…
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…
A tiling of a topological disc by topological discs is called monohedral if all tiles are congruent. Maltby (J. Combin. Theory Ser. A 66: 40-52, 1994) characterized the monohedral tilings of a square by three topological discs. Kurusa,…
A dyadic tile of order n is any rectangle obtained from the unit square by n successive bisections by horizontal or vertical cuts. Let each dyadic tile of order n be available with probability p, independently of the others. We prove that…
Let $\mathcal{T}_n$ be the set of ribbon $L$-shaped $n$-ominoes for some $n\ge 4$ even, and let $\mathcal{T}_n^+$ be $\mathcal{T}_n$ with an extra $2\times 2$ square. We investigate signed tilings of rectangles by $\mathcal{T}_n$ and…
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…
We consider the problem of characterizing finite sets which tile the integers by translations. Coven and Meyerowitz (J. Algebra 1999) found necessary and sufficient conditions for a finite set A to tile the integers under the assumption…