Related papers: A $\sigma$-morphic convex protoset

It is well known that if there exists a finite set of convex bodies on the plane with non-overlapping interiors, then there is at least one "extremal" one among them, i.e., some one which can be continuously "taken away to the infinity"…

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…

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,…

A basic assumption of tiling theory is that adjacent tiles can meet in only a finite number of ways, up to rigid motions. However, there are many interesting tiling spaces that do not have this property. They have "fault lines", along which…

We know that tilesets that can tile the plane always admit a quasi-periodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicity function is one way to measure the regularity of a quasi-periodic…

A famous problem in discrete geometry is to find all monohedral plane tilers, which is still open to the best of our knowledge. This paper concerns with one of its variants that to determine all convex polyhedra whose every cross-section…

Aperiodic tiling is a well-know area of research. First developed by mathematicians for the mathematical challenge they represent and the beauty of their resulting patterns, they became a growing field of interest when their practical use…

The notion of weak tiling played a key role in the proof of Fuglede's spectral set conjecture for convex domains, due to the fact that every spectral set must weakly tile its complement. In this paper, we revisit the notion of weak tiling…

We present an exhaustive search of all families of convex pentagons which tile the plane. This research shows that there are no more than the already 15 known families. In particular, this implies that there is no convex polygon which…

Generalizing results by Valette, Zamfirescu and Laczkovich, we will prove that a convex body $K$ is a polytope if there are sufficiently many tilings which contain a tile similar to $K$. Furthermore, we give an example that this can not be…

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…

Every body knows that identical regular triangles or squares can tile the whole plane. Many people know that identical regular hexagons can tile the plane properly as well. In fact, even the bees know and use this fact! Is there any other…

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…

A convex pentagonal tile is a convex pentagon that admits a monohedral tiling. We show that a convex pentagonal tile that admits a periodic tiling has a property in which the sum of three internal angles of the pentagon is equal to…

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…

We consider polygons with the following ``pairing property'': for each edge of the polygon there is precisely one other edge parallel to it. We study the problem of when such a polygon $K$ tiles the plane multiply when translated at the…

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…

We show that convex pentagons that can generate edge-to-edge monohedral tilings of the plane can be classified into exactly eight types. Using these results, it is also proved that no single convex polygon can be an aperiodic prototile…

Let $T$ be a tile in $\mathbb{Z}^n$, meaning a finite subset of $\mathbb{Z}^n$. It may or may not tile $\mathbb{Z}^n$, in the sense of $\mathbb{Z}^n$ having a partition into copies of $T$. However, we prove that $T$ does tile $\mathbb{Z}^d$…

Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this…