Related papers: Sturmian lattices and Aperiodic tile sets
This article builds on Thurston's height functions. His tiling algorithm is reinterpreted using lattice theory and then generalized in order to generate any tiling of a hole-free region. Combined with a natural encoding of tilings by words,…
We establish the existence of `time quasilattices' as stable trajectories in dissipative dynamical systems. These tilings of the time axis, with two unit cells of different durations, can be generated as cuts through a periodic lattice…
We present a multi-edge-length aperiodic tiling which exhibits 6--fold rotational symmetry. The edge lengths of the tiling are proportional to 1:$\tau$, where $\tau$ is the golden mean $\frac{1+\sqrt{5}}{2}$. We show how the tiling can be…
Ammann bars are formed by segments (decorations) on the tiles of a tiling such that forming straight lines with them while tiling forces non-periodicity. Only a few cases are known, starting with Robert Ammann's observations on Penrose…
In our earlier paper [A square root map on Sturmian words, Electron. J. Combin. 24.1 (2017)], we introduced a symbolic square root map. Every optimal squareful infinite word $s$ contains exactly six minimal squares and can be written as a…
The class of Cyclotomic Aperiodic Substitution Tilings (CAST) is introduced. Its vertices are supported on the 2n-th cyclotomic field. It covers a wide range of known aperiodic substitution tilings of the plane with finite rotations.…
This study proposes a method for producing an infinite number of fractals using aperiodic substitution tilings, exemplified by the Ammann Chair tiling. Higher-order substitutions of aperiodic tilings are utilized in relation to the…
We introduce a new general framework for constructing tilings of Euclidean space, which we call multiscale substitution tilings. These tilings are generated by substitution schemes on a finite set of prototiles, in which multiple distinct…
We give a set of tiles that enforces the sphinx tiling substitution system; the tiles are thus aperiodic.
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…
This paper presents the construction and various properties of substitution tilings related to Stern's diatomic series and based on tiles decorated with elements of $\mathbb{F}_p$ for some odd prime number $p$. These substitution tilings…
We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…
The Sturm sequence is generated by a pair of polynomials $P(x)$ and $P'(x)$, where $P(x)$ is assumed to have simple real roots. Euclidean algorithm generates then a finite sequence of polynomials orthogonal on the grid $x_s$ of roots of the…
General substitution rules for non-periodic rhomb tilings are derived. From the requirement that all substitution tiles consist of a discrete number of prototiles, it follows that a substitution tile with angle s*pi/n must be built out of…
A group-theoretical approach to the construction of quasiperiodic tilings of a Euclidean plane, possessing five-fold symmetry, is applied. Of the infinitely many of variants of quasiperiodic partitions of the plane, possessing the dihedral…
Substitution schemes provide a classical method for constructing tilings of Euclidean space. Allowing multiple scales in the scheme, we introduce a rich family of sequences of tile partitions generated by the substitution rule, which…
We propose a construction of lattices from (skew-) polynomial codes, by endowing quotients of some ideals in both number fields and cyclic algebras with a suitable trace form. We give criteria for unimodularity. This yields integral and…
We briefly review the standard methods used to construct quasiperiodic tilings, such as the projection, the inflation, and the grid method. A number of sample Mathematica programs, implementing the different approaches for one- and…
The set of permutations on a finite set can be given a lattice structure (known as the weak Bruhat order). The lattice structure is generalized to the set of words on a fixed alphabet $\Sigma = \{ x, y, z, ... \}$, where each letter has a…
It is well known that Sturmian sequences are the aperiodic sequences that are balanced over a 2-letter alphabet. They are also characterized by their complexity: they have exactly $(n+1)$ factors of length $n$. One possible generalization…