Related papers: The Path to Aperiodic Monotiles

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…

This is an appendix to the Handbook of Tilting Theory, edited by Angeleri-Huegel, Happel and Krause, to be published soon. Part 1 of the appendix provides an outline of the core of tilting theory. Part 2 is devoted to topics where tilting…

In this paper, we prove that the general problem of tiling the hyperbolic plane with \`a la Wang tiles is undecidable.

Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this…

In aperiodic order, non-periodic but "ordered" objects such as tilings, Delone sets, functions and measures are investigated. In this article we depict the common structure of these objects by using the general framework of abstract pattern…

We show that given any tiling of Euclidean space, any geometric patterns of points, we can find a patch of tiles (of arbitrarily large size) so that copies of this patch appear in the tiling nearly centered on a scaled and translated…

We give an alternative simple proof that the monotile introduced by Smith, Myers, Kaplan and Goodman-Strass is aperiodic.

Tilings of the plane resemble the simplicial and other complexes from algebraic topology, but have not been studied from this perspective. We construct finite categories corresponding to polygons with labeled directed edges, and introduce…

We find explicit optimal vertex, edge and face coulourings for the chair tiling, the Ammann--Beenker tiling, the rational pinwheel tiling and the pinwheel tiling.

This note describes how to construct toroidal polyhedra which are homotopic to a given type of knot and which admit an isohedral tiling of 3-space.

We consider tilings of Euclidean spaces by polygons or polyhedra, in particular, tilings made by a substitution process, such as the Penrose tilings of the plane. We define an isomorphism invariant related to a subgroup of rotations and…

It has been known since the beginning of this century that isomonodromic problems --- typically the Painlev\'e transcendents --- in a suitable asymptotic region look like a kind of ``modulation'' of isospectral problem. This connection…

The translational tiling problem, dated back to Wang's domino problem in the 1960s, is one of the most representative undecidable problems in the field of discrete geometry and combinatorics. Ollinger initiated the study of the…

In this paper, we consider a numerical method to solve scattering problems with multi-periodic layers with different periodicities. The main tool applied in this paper is the Bloch transform. With this method, the problem is written into an…

The goal of this work is to study the existence of quasi-periodic solutions in time to nonlinear beam equations with a multiplicative potential. The nonlinearities are required to only finitely differentiable and the frequency is along a…

This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…

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…

This short article, which appeared in the MSRI Fall 2004 newletter, is intended for a general mathematical audience. It describes some mathematical themes from the Winter 2004 program at MSRI in topological aspects of real algebraic…

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

Kautz and de Bruijn graphs have a high degree of connectivity which makes them ideal candidates for massively parallel computer network topologies. In order to realize a practical computer architecture based on these graphs, it is useful to…