Related papers: Characterization of the Three-Dimensional Fivefold…

We prove the Voronoi conjecture for five-dimensional parallelohedra. Namely, we show that if a convex five-dimensional polytope $P$ tiles $\mathbb R^5$ with translations, then $P$ is an affine image of the Dirichlet-Voronoi polytope for a…

Convex hexagons that can tile the plane have been classified into three types. For the generic cases (not necessarily convex) of the three types and two other special cases, we classify tilings of the plane under the assumption that all…

We characterize the polytopes in $\mathbb{R}^d$ (not necessarily convex or connected ones) which multi-tile the space by translations along a given lattice. We also give a necessary and sufficient condition for two polytopes in…

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…

3D-facets of the Delone cells representing the deep and shallow holes of the root lattice D6 which tile the six-dimensional Euclidean space in an alternating order are projected into three-dimensional space. They are classified into six…

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…

We prove that the following problem is co-RE-complete and thus undecidable: given three simple polygons, is there a tiling of the plane where every tile is an isometry of one of the three polygons (either allowing or forbidding…

This paper shows that a multiple translative tile in the plane must be a multiple lattice tile.

We study the problem of covering R^d by overlapping translates of a convex body P, such that almost every point of R^d is covered exactly k times. Such a covering of Euclidean space by translations is called a k-tiling. The investigation of…

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 first undecidability result on the tiling is the undecidability of translational tiling of the plane with Wang tiles, where there is an additional color matching requirement. Later, researchers obtained several undecidability results on…

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

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…

In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…

In this study, the properties of convex pentagons that can form rotationally symmetric edge-to-edge tilings are discussed. Because the rotationally symmetric tilings are formed by concave octagons that are generated by two convex pentagons…

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…

The hexagonal tiling honeycomb is a beautiful structure in 3-dimensional hyperbolic space. It is called {6,3,3} because each hexagon has 6 edges, 3 hexagons meet at each vertex in a Euclidean plane tiled by regular hexagons, and 3 such…

The problem of classifying the convex pentagons that admit tilings of the plane is a long-standing unsolved problem. Previous to this article, there were 14 known distinct kinds of convex pentagons that admit tilings of the plane. Five of…

We classify the convex polytopes whose symmetry groups have two orbits on the flags. These exist only in two or three dimensions, and the only ones whose combinatorial automorphism group is also two-orbit are the cuboctahedron, the…

We study $C^1$-regular surfaces in $R^3$ that admit tilings by a finite number of rigid motion congruence classes of tiles. We construct examples with various topologies and present a framework for a systematic study, mainly concentrating…