Related papers: Local Rules for Computable Planar Tilings
An h-tiling on a finite simplicial complex is a partition of its geometric realization by maximal simplices deprived of several codimension one faces together with possibly their remaining face of highest codimension. In this last case, the…
We count tilings of the $n \times m$ rectangular grid, cylinder, and torus with arbitrary tile sets up to arbitrary symmetries of the square and rectangle, along with cyclic shifting of rows and columns. This provides a unifying framework…
This paper focuses on the undecidability of translational tiling of $n$-dimensional space $\mathbb{Z}^n$ with a set of $k$ tiles. It is known that tiling $\mathbb{Z}^2$ with translated copies with a set of $8$ tiles is undecidable.…
We introduce a family of planar regions, called Aztec diamonds, and study the ways in which these regions can be tiled by dominoes. Our main result is a generating function that not only gives the number of domino tilings of the Aztec…
The non-emptiness, called the Domino Problem, and the characterization of the possible entropies of $\mathbb{Z}^2$-subshifts of finite type are standard problems of symbolic dynamics. In this article we study these questions with horizontal…
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 2023, the quest for an aperiodic monotile was answered by the hat monotile. In this article, structures in this aperiodic tiling are discovered, which allow for a direct computation of the tiling, similar to well-known methods for the…
Aperiodic crystals are the intermediates between strictly periodic crystalline matter and amorphous solids. The lack of translational symmetry combined with intrinsic long-range order endows aperiodic crystals with unique physical…
An aperiodic prototile is a shape for which infinitely many copies can be arranged to fill Euclidean space completely with no overlaps, but not in a periodic pattern. Tiling theorists refer to such a prototile as an "einstein" (a German pun…
The Wang tiling is a classical problem in combinatorics. A major theoretical question is to find a (small) set of tiles which tiles the plane only aperiodically. In this case, resulting tilings are rather restrictive. On the other hand,…
This introductory survey deals with mathematical and physical properties of discrete structures such as point sets and tilings. The emphasis is on proper generalizations of concepts and ideas from classical crystallography. In particular,…
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…
We consider tilings of a triangle $ABC$ by congruent copies of a triangle that has one angle equal to $120^\circ$, has non-commensurable angles (that is, not all angles are rational multiples of $\pi$), and is not similar to $ABC$. We prove…
Common definitions of the "standard" LOCAL model tend to be sloppy and even self-contradictory on one point: do the nodes update their state using an arbitrary function or a computable function? So far, this distinction has been safe to…
Periodic and semi periodic patterns are very common in nature. In this paper we introduce a topological toolbox aiming in detecting and quantifying periodicity. The presented technique is of a general nature and may be employed wherever…
We solve and generalize an open problem posted by James Propp (Problem 16 in New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999) on the number of tilings of quasi-hexagonal regions on the square lattice with every…
A domino covering of a board is saturated if no domino is redundant. We introduce the concept of a fragment tiling and show that a minimal fragment tiling always corresponds to a maximal saturated domino covering. The size of a minimal…
We study classical dimers on two-dimensional quasiperiodic Ammann-Beenker (AB) tilings. Despite the lack of periodicity we prove that each infinite tiling admits 'perfect matchings' in which every vertex is touched by one dimer. We…
We investigate the connections between the fields of distributed computing and measurable combinatorics by considering complexity classes of locally checkable labeling problems on regular forests. We show that the most important…
We show that the domino problem is undecidable on orbit graphs of non-deterministic substitutions which satisfy a technical property. As an application, we prove that the domino problem is undecidable for the fundamental group of any closed…