Related papers: Signed shape tilings of squares

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…

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

We say that a function $f \in L^1(\mathbb{R})$ tiles at level $w$ by a discrete translation set $\Lambda \subset \mathbb{R}$, if we have $\sum_{\lambda \in \Lambda} f(x-\lambda)=w$ a.e. In this paper we survey the main results, and prove…

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…

The present article studies combinatorial tilings of Euclidean or spherical spaces by polytopes, serving two main purposes: first, to survey some of the main developments in combinatorial space tiling; and second, to highlight some new and…

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…

The question of whether a given region can be successfully filled by a finite set of tiles has been commonly studied, and there are many available arguments for whether a given finite region can be tiled. We can show that there is no domino…

Tile the unit square with $n$ small squares. We determine the minimum of the sum of the side lengths of the $n$ small squares, where the minimum is taken over all tilings of the unit square with $n$ squares.

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

We consider tilings of a rectangle which is n units wide and m units long by non-overlapping 1 X 1 squares and s X s squares. Bivariate generating functions are computed with the Transfer Matrix Method for moderately large but fixed widths…

It has been proven that the lozenge tilings of a quartered hexagon on the triangular lattice are enumerated by a simple product formula. In this paper we give a new proof for the tiling formula by using Kuo's graphical condensation. Our…

A tiling (edge-to-edge) of the plane is a family of tiles that cover the plane without gaps or overlaps. Vertex figure of a vertex in a tiling to be the union of all edges incident to that vertex. A tiling is $k$-vertex-homogeneous if any…

Step by step completion of a left-to-right tiling of a rectangular floor with tiles of a single shape starts from one edge of the floor, considers the possible ways of inserting a tile at the leftmost uncovered square, passes through a…

We prove combinatorially that the parity of the number of domino tilings of a region is equal to the parity of the number of domino tilings of a particular subregion. Using this result we can resolve the holey square conjecture. We…

We present a simple construction of hat tilings. The construction can be carried out by superimposing a triangular grid on a specially colored image and reading off the orientation of the tiles. We show that our construction produces valid…

In the perfect tiling problem, we aim to cover the vertices of a hypergraph~$G$ with pairwise vertex-disjoint copies of a hypergraph $F$. There are three essentially necessary conditions for such a perfect tiling, which correspond to…

We propose a skein model for the quantum cluster algebras of surface type with coefficients. We introduce a skein algebra $\mathscr{S}_{\Sigma,\mathbb{W}}^{A}$ of a walled surface $(\Sigma,\mathbb{W})$, and prove that it has a quantum…

The Taylor-Socolar tilings are regular hexagonal tilings of the plane but are distinguished in being comprised of hexagons of two colors in an aperiodic way. We place the Taylor-Socolar tilings into an algebraic setting which allows one to…

In this work, we consider tilings of the Hamming cube and look for metrics which turn the tilings into a perfect code. We consider the family of metrics which are determined by a weight and are compatible with the support of vectors…