Related papers: A tiling algorithm for the aperiodic monotile Tile…
We present a technique for the enumeration of all isotopically distinct ways of tiling a hyperbolic surface of finite genus, possibly nonorientable and with punctures and boundary. This provides a generalization of the enumeration of…
In this paper, we give a proof that it is undecidable whether a set of five polyominoes can tile the plane by translation. The proof involves a new method of labeling the edges of polyominoes, making it possible to assign whether two edges…
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…
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…
The embedding of a given point set with non-crystallographic symmetry into higher-dimensional space is reviewed, with special emphasis on the Minkowski embedding known from number theory. This is a natural choice that does not require an a…
This paper studies properties of tilings of the plane by parallelograms. In particular it is established that in parallelogram tilings using a finite number of shapes all tiles occur in only finitely many orientations.
We present a simplified proof of a forty-year-old result concerning the tiling of the plane with equilateral convex polygons. Our approach is based on a theorem by M. Rao, who used an exhaustive computer search to confirm the completeness…
This paper is intended to provide an introduction to the theory of substitution tilings. For our purposes, tiling substitution rules are divided into two broad classes: geometric and combinatorial. Geometric substitution tilings include…
Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…
We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.
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…
Due to the growing request from modern wireless applications of cost-affordable and high-gain scanning antenna solutions, the design of large phased arrays (PAs) with radiating elements organized into modular clusters with sub-array-only…
We study nonperiodic tilings of the line obtained by a projection method with an interval projection structure. We obtain a geometric characterisation of all interval projection tilings that admit substitution rules and describe the set of…
The present paper is a new version of the arXiv paper revisiting the proof given in a previous paper of the author published in 2008 proving that the general tiling problem of the hyperbolic plane is undecidable by proving a slightly…
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…
A semi-regular tiling of the hyperbolic plane is a tessellation by regular geodesic polygons with the property that each vertex has the same vertex-type, which is a cyclic tuple of integers that determine the number of sides of the polygons…
We count tilings of a rectangle of integer sides m-1 and n-1 by a special set of tiles. The result is obtained fron the study of the kernel of the adjacency matrix of an n x n rectangular graph of Z x Z.
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 Calisson puzzle is a tiling puzzle in which one must tile a triangular grid inside a hexagon with lozenges, under the constraint that certain prescribed edges remain tile boundaries and that adjacent lozenges along these edges have…
Several articles deal with tilings with squares and dominoes of the well-known regular square mosaic in Euclidean plane, but not any with the hyperbolic regular square mosaics. In this article, we examine the tiling problem with colored…