Related papers: Filling a box with translates of two bricks

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

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…

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 give a computer-based proof of the following fact: If a square is divided into seven or nine convex polygons, congruent among themselves, then the tiles are rectangles.

We study multiple tilings of 3-dimensional Euclidean space by a convex body. In a multiple tiling, a convex body $P$ is translated with a discrete multiset $\Lambda$ in such a way that each point of the space gets covered exactly $k$ times,…

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…

Let $\cal T$ be a tiling of the plane with equilateral triangles no two of which share a side. We prove that if the side lengths of the triangles are bounded from below by a positive constant, then $\cal T$ is periodic and it consists of…

In this paper, we prove that if a finite number of rectangles, every of which has at least one integer side, perfectly tile a big rectangle then there exists a strategy which reduces the number of these tiles (rectangles) without violating…

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…

We study the problem of perfect tiling in the plane and exploring the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given,…

It is broadly known that any parallelepiped tiles space by translating copies of itself along its edges. In earlier work relating to higher-dimensional sandpile groups, the second author discovered a novel construction which fragments the…

We look at sets of tiles that can tile any region of size greater than 1 on the square grid. This is not the typical tiling question, but relates closely to it and therefore can help solve other tiling problems -- we give an example of…

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…

Let a polygon be composed of equal rectangles. We find all quadratic irrationals r for which the polygon can be tiled by similar rectangles with given side ratio r.

Given a collection of N rectangles such that the side ratio of each one is a quadratic irrationality, we find all rectangles which can be tiled by rectangles similar to one of the given ones. It means that each possible shape can be used…

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…

Since the thesis of K. Reinhardt in 1918, it is well known that there are exactly three types of convex hexagons that can tile the plane. However, the proof of the fact is far from being complete. We prove this fact, under an assumption…

Polymetric walls are walls built from bricks in more than one size. Architects and builders want to built polymetric walls that satisfy certain structural and aesthetical constraints. In a recent paper by de Jong, Vinduska, Hans and Post…

Each packing of R^d by translates of the unit cube [0,1)^d admits a decomposition into at most two parts such that if a translate of the unit cube is covered by one of them, then it also belongs to such a part.

Given a tiling of a 2D grid with several types of tiles, we can count for every row and column how many tiles of each type it intersects. These numbers are called the_projections_. We are interested in the problem of reconstructing a tiling…