Related papers: Ax, 3 polyominoes for tiling the plane non-periodi…
A new method for constructing aperiodic tilings is presented. The method is illustrated by constructing a particular tiling and its hull. The properties of this tiling and the hull are studied. In particular it is shown that these tilings…
A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…
We show that convex pentagons that can generate edge-to-edge monohedral tilings of the plane can be classified into exactly eight types. Using these results, it is also proved that no single convex polygon can be an aperiodic prototile…
The 1-2-3 conjecture has been solved positively in 2024 for finite graphs and by extension for infinite graphs which are locally finite. The solution is non-constructive, and finding explicit solutions for large (or infinite) graphs is very…
We describe computer algorithms that produce the complete set of isohedral tilings by n-omino or n-iamond tiles in which the tiles are fundamental domains and the tilings have 3-, 4-, or 6-fold rotational symmetry. The symmetry groups of…
We study the minimal complexity of tilings of a plane with a given tile set. We note that every tile set admits either no tiling or some tiling with O(n) Kolmogorov complexity of its n-by-n squares. We construct tile sets for which this…
This paper introduces two tiles whose tilings form a one-parameter family of tilings which can all be seen as digitization of two-dimensional planes in the four-dimensional Euclidean space. This family contains the Ammann-Beenker tilings as…
In this article we study Ammann tilings from the perspective of symplectic geometry. Ammann tilings are nonperiodic tilings that are related to quasicrystals with icosahedral symmetry. We associate to each Ammann tiling two explicitly…
A plane tiling consisting of congruent copies of a shape is isohedral provided that for any pair of copies, there exists a symmetry of the tiling mapping one copy to the other. We give a $O(n\log^2{n})$-time algorithm for deciding if a…
\noindent The algebraic characterization of classes of locally isomorphic aperiodic tilings, being examples of quantum spaces, is conducted for a certain type of tilings in a manner proposed by A. Connes. These $2$-dimensional tilings are…
We give a set of tiles that enforces the sphinx tiling substitution system; the tiles are thus aperiodic.
We give a proof of Ollinger's conjecture that the problem of tiling the plane with translated copies of a set of $8$ polyominoes is undecidable. The techniques employed in our proof include a different orientation for simulating the Wang…
Moir\'e patterns of twisted and scaled bilayers have recently emerged as a fertile source of quasiperiodic order in two-dimensional materials. Inspired by these systems, we introduce the \emph{near-coincidence method} for generating…
In the past three decades, the study of rhombus tilings and domino tilings of various plane regions has been a thriving subfield of enumerative combinatorics. Physicists classify such work as the study of dimer covers of finite graphs. In…
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 say that a tile is $\sigma$-morphic if it tiles the plane in exactly $\aleph_0$ many noncongruent ways (up to an isometry). It is an unsolved problem of whether a $\sigma$-morphic tile exist in the plane. In this note we present a…
Classical results on aperiodic tilings are rather complicated and not widely understood. Below, an alternative approach is discussed in hope to provide additional intuition not apparent in classical works.
This is a review (in Italian) on aperiodic tilings of the plane intended for a general audience. First, we recall some basic results about lattices and periodic tilings. Then, we move on to one-dimensional (domino) tilings and Wang tilings.…
An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics ranging from logic (the Entscheidungsproblem) to physics…
Cao & Yuan obtained a Blichfeldt-type result for the vertex set of the edge-to-edge tiling of the plane by regular hexagons. Observing that every Archimedean tiling is the union of translates of a fixed lattice, we take a more general…