Related papers: Aperiodic tilings with one prototile and low compl…

One well studied way to construct quasicrystalline tilings is via inflate-and-subdivide (a.k.a. substitution) rules. These produce self-similar tilings--the Penrose, octagonal, and pinwheel tilings are famous examples. We present a…

We present a construction of a family of non-periodic tilings using elementary tools such as modular arithmetic and vector geometry. These tilings exhibit a distinct type of structural regularity, which we term modulo-staggered rotational…

The Pattern self-Assembly Tile set Synthesis (PATS) problem is to determine a set of coloured tiles that self-assemble to implement a given rectangular colour pattern. We give an exhaustive branch-and-bound algorithm to find tile sets of…

The pinwheel triangle of Conway and Radin is a standard example for tilings with self-similarity and statistical circular symmetry. Many modifications were constructed, all based on partitions of triangles or rectangles. The fractal example…

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…

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…

Tile-based self-assembly systems are capable of universal computation and algorithmically-directed growth. Systems capable of such behavior typically make use of "glue cooperation" in which the glues on at least $2$ sides of a tile must…

In this paper we prove the existence of quasiperiodic rhombic substitution tilings with 2n-fold rotational symmetry, for any n. The tilings are edge-to-edge and use [n/2] rhombic prototiles with unit length sides. We explicitly describe the…

Suppose $P$ is a symmetric convex polygon in the plane. We give a polynomial time algorithm that decides if $P$ can tile the plane by transations at some level (not necessarily at level one; this is multiple tiling). The main technical…

Every simple quadrangulation of the sphere is generated by a graph called a pseudo-double wheel with two local expansions (Brinkmann et al. "Generation of simple quadrangulations of the sphere." Discrete Math., Vol. 305, No. 1-3, pp. 33-54,…

This paper deals with (globally) random substitutions on a finite set of prototiles. Using renormalization tools applied to objects from operator algebras we establish upper and lower bounds on the rate of deviations of ergodic averages for…

This paper is concerned with realizing Lattes maps as subdivision maps of finite subdivision rules. The main result is that the Lattes maps in all but finitely many analytic conjugacy classes can be realized as subdivision maps of finite…

Model sets (or cut and project sets) provide a familiar and commonly used method of constructing and studying nonperiodic point sets. Here we extend this method to situations where the internal spaces are no longer Euclidean, but instead…

This paper gives new solutions to the problem: 'Can we construct monohedral tilings of the disk such that a neighbourhood of the origin has trivial intersection with at least one tile?'

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…

This work is devoted to the study of the symmetries of (quasi)periodic architectured materials. For this purpose, the weaker symmetry criterion of indistinguishability is used. It relies on a statistical description of the mesostructure and…

This paper defines the Arrwwid number of a recursive tiling (or space-filling curve) as the smallest number w such that any ball Q can be covered by w tiles (or curve sections) with total volume O(vol(Q)). Recursive tilings and…

The study of tilings is a major problem in many mathematical instances, which is studied in two main different approaches: when considering the existence (or obstructions to the existence) of a tiling with a given tile and the other…

We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.

The top of the attractor $A$ of a hyperbolic iterated function system $\left\{ f_{i}:\mathbb{R}^{n}\rightarrow\mathbb{R}^{n}|i=1,2,\dots,M\right\} $ is defined and used to extend self-similar tilings to overlapping systems. The theory…