Related papers: Undecidability of Translational Tiling with 2 Poly…
Suppose $f\in L^1(\mathbb{R}^d)$, $\Lambda\subset\mathbb{R}^d$ is a finite union of translated lattices such that $f+\Lambda$ tiles with a weight. We prove that there exists a lattice $L\subset{\mathbb{R}}^d$ such that $f+L$ also tiles,…
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…
We give a new proof of the following interesting fact recently proved by Bower and Michael: if a d-dimensional rectangular box can be tiled using translates of two types of rectangular bricks, then it can also be tiled in the following way.…
Several articles deal with tilings with squares and dominoes on 2-dimensional boards, but only a few on boards in 3-dimensional space. We examine a tiling problem with colored cubes and bricks of $(2\times2\times n)$-board in three…
A cube tiling of $\mathbb{R}^d$ is a family of pairwise disjoint cubes $[0,1)^d+T=\{[0,1)^d+t\colon t\in T\}$ such that $\bigcup_{t\in T}([0,1)^d+t)=\mathbb{R}^d$. Two cubes $[0,1)^d+t$, $[0,1)^d+s$ are called a twin pair if $|t_j-s_j|=1$…
Deciding if a given set of Wang tiles admits a tiling of the plane is decidable if the number of Wang tiles (or the number of colors) is bounded, for a trivial reason, as there are only finitely many such tilesets. We prove however that the…
We obtain structural results on translational tilings of periodic functions in $\mathbb{Z}^d$ by finite tiles. In particular, we show that any level one tiling of a periodic set in $\mathbb{Z}^2$ must be weakly periodic (the disjoint union…
We show that three dimensional cubes of any size can be tiled with trominoes and, when necessary, one or two singletons in any positions. Cubes of side length a multiple of three can always be tiled with trominoes (known), cubes of side…
We prove that is a measurable domain tiles R or R^2 by translations, and if it is "close enough" to a line segment or a square respectively, then it admits a lattice tiling. We also prove a similar result for spectral sets in dimension 1,…
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…
The periodic tiling conjecture asserts that any finite subset of a lattice $\mathbb{Z}^d$ which tiles that lattice by translations, in fact tiles periodically. In this work we disprove this conjecture for sufficiently large $d$, which also…
To study the fixed parameter undecidability of tiling problem for a set of Wang tiles, Jeandel and Rolin show that the tiling problem for a set of 44 Wang bars is undecidable. In this paper, we improve their result by proving that whether a…
Altenbernd, Thomas and W\"ohrle have considered acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with usual acceptance conditions, such as the B\"uchi and Muller ones [1]. It was proved…
We construct a unilateral lattice tiling of $\mathbb{R}^n$ into hypercubes of two differnet side lengths $p$ or $q$. This generalizes the Pythagorean tiling in $\mathbb{R}^2$. We also show that this tiling is unique up to symmetries, which…
In this piece, we examine one variant of the infamous 15 Tile Puzzle and develop a mathematical backing behind why it is unsolvable. Using concepts of permutations, bijectivity, and cycle transpositions, we not only prove how to model this…
Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…
The periodic tiling conjecture asserts that any finite subset of a lattice $\mathbb{Z^d}$ which tiles that lattice by translations, in fact tiles periodically. We announce here a disproof of this conjecture for sufficiently large $d$, which…
Which polygons admit two (or more) distinct lattice tilings of the plane? We call such polygons double tiles. It is well-known that a lattice tiling is always combinatorially isomorphic either to a grid of squares or to a grid of regular…
An equilateral triangle cannot be dissected into finitely many mutually incongruent equilateral triangles [Tutte 1948]. Therefore Tuza [Tuza 1991] asked for the largest number $s=s(n)$ such that there is a tiling of an equilateral triangle…
This paper proves the following statement: {\it If a convex body can form a twofold translative tiling in $\mathbb{E}^3$, it must be a parallelohedron.} In other words, it must be a parallelotope, a hexagonal prism, a rhombic dodecahedron,…