Related papers: Matching Rules for the Sphinx Tiling Substitution
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…
In this paper we describe the pentagonal tiling of the plane defined in the article "A regular pentagonal tiling of the plane" by P. L. Bowers and K. Stephenson as a conformal substitution tiling and summarize many of its properties given…
Rhombus Penrose tilings are tilings of the plane by two decorated rhombi such that the decoration match at the junction between two tiles (like in a jigsaw puzzle). In dynamical terms, they form a tiling space of finite type. If we remove…
We prove linearly repetitive Delone systems have finitely many Delone system factors up to conjugacy. This result is also applicable to linearly repetitive tiling systems.
An important question in dynamical systems is the classification problem, i.e., the ability to distinguish between two isomorphic systems. In this work, we study the topological factors between a family of multidimensional substitutive…
We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive…
We consider substitution tilings and Delone sets without the assumption of finite local complexity (FLC). We first give a sufficient condition for tiling dynamical systems to be uniquely ergodic and a formula for the measure of cylinder…
Translational tiling problems are among the most fundamental and representative undecidable problems in all fields of mathematics. Greenfeld and Tao obtained two remarkable results on the undecidability of translational tiling in recent…
It is known that a positive, compactly supported function $f \in L^1(\mathbb R)$ can tile by translations only if the translation set is a finite union of periodic sets. We prove that this is not the case if $f$ is allowed to have unbounded…
We define 2-dimensional topological substitutions. A tiling of the Euclidean plane, or of the hyperbolic plane, is substitutive if the underlying 2-complex can be obtained by iteration of a 2-dimensional topological substitution. We prove…
We report conditions on a switching signal that guarantee that solutions of a switched linear systems converge asymptotically to zero. These conditions are apply to continuous, discrete-time and hybrid switched linear systems, both those…
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,…
We obtain tilings with a singular point by applying conformal maps on regular tilings of the Euclidean plane, and determine its symmetries. The resulting tilings are then symmetrically colored by applying the same conformal maps on…
In this paper, we are mainly interested in the two questions "which are the commutative rings on which every finitely presented modules is [Formula: see text]-periodic (respectively, [Formula: see text]-periodic)?". It is proved that these…
We generalise the notion of a Barge-Diamond complex, in the one-dimensional case, to a mixed system of tiling substitutions. This gives a way of describing the associated tiling space as an inverse limit of Barge-Diamond complexes. We give…
We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with rational angles in degree: they are a one-parameter family of symmetric $a^4b$-pentagonal subdivisions of the tetrahedron with…
Let $T$ be a tile in $\mathbb{Z}^n$, meaning a finite subset of $\mathbb{Z}^n$. It may or may not tile $\mathbb{Z}^n$, in the sense of $\mathbb{Z}^n$ having a partition into copies of $T$. However, we prove that $T$ does tile $\mathbb{Z}^d$…
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 prove that the lamplighter group admits strongly aperiodic SFTs, has undecidable tiling problem, and the entropies of its SFTs are exactly the upper semicomputable nonnegative real numbers, and some other results. These results follow…
We prove that the following problem is co-RE-complete and thus undecidable: given three simple polygons, is there a tiling of the plane where every tile is an isometry of one of the three polygons (either allowing or forbidding…