Fixed-point tile sets and their applications

v4: added references to a paper by Nicolas Ollinger and several historical commentsAn 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 (quasicrystals). We present a new construction of an aperiodic tile set that is based on Kleene's fixed-point construction instead of geometric arguments. This construction is similar to J. von Neumann self-reproducing automata; similar ideas were also used by P. Gacs in the context of error-correcting computations. This construction it rather flexible, so it can be used in many ways: we show how it can be used to implement substitution rules, to construct strongly aperiodic tile sets (any tiling is far from any periodic tiling), to give a new proof for the undecidability of the domino problem and related results, characterize effectively closed 1D subshift it terms of 2D shifts of finite type (improvement of a result by M. Hochman), to construct a tile set which has only complex tilings, and to construct a "robust" aperiodic tile set that does not have periodic (or close to periodic) tilings even if we allow some (sparse enough) tiling errors. For the latter we develop a hierarchical classification of points in random sets into islands of different ranks. Finally, we combine and modify our tools to prove our main result: there exists a tile set such that all tilings have high Kolmogorov complexity even if (sparse enough) tiling errors are allowed

On the structure of Ammann A2 tilings

We establish a structure theorem for the family of Ammann A2 tilings of the plane. Using that theorem we show that every Ammann A2 tiling is self-similar in the sense of [B. Solomyak, Nonperiodicity implies unique composition for self-similar translationally finite tilings, Discrete and Computational Geometry 20 (1998) 265-279]. By the same techniques we show that Ammann A2 tilings are not robust in the sense of [B. Durand, A. Romashchenko, A. Shen. Fixed-point tile sets and their applications, Journal of Computer and System Sciences, 78:3 (2012) 731--764]

Fixed Point and Aperiodic 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 (quasicrystals) We present a new construction of an aperiodic tile set that is based on Kleene's fixed-point construction instead of geometric arguments. This construction is similar to J. von Neumann self-reproducing automata; similar ideas were also used by P. Gacs in the context of error-correcting computations. The flexibility of this construction allows us to construct a "robust" aperiodic tile set that does not have periodic (or close to periodic) tilings even if we allow some (sparse enough) tiling errors. This property was not known for any of the existing aperiodic tile sets.Comment: v5: technical revision (positions of figures are shifted

Quasiperiodicity and non-computability in 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 fixed point construction; we improve this general technique and make it enforce the property of local regularity of tilings needed for quasiperiodicity. We prove also a stronger result: any effectively closed set can be recursively transformed into a tile set so that the Turing degrees of the resulted tilings consists exactly of the upper cone based on the Turing degrees of the later.Comment: v3: the version accepted to MFCS 201

Image Sampling with Quasicrystals

We investigate the use of quasicrystals in image sampling. Quasicrystals produce space-filling, non-periodic point sets that are uniformly discrete and relatively dense, thereby ensuring the sample sites are evenly spread out throughout the sampled image. Their self-similar structure can be attractive for creating sampling patterns endowed with a decorative symmetry. We present a brief general overview of the algebraic theory of cut-and-project quasicrystals based on the geometry of the golden ratio. To assess the practical utility of quasicrystal sampling, we evaluate the visual effects of a variety of non-adaptive image sampling strategies on photorealistic image reconstruction and non-photorealistic image rendering used in multiresolution image representations. For computer visualization of point sets used in image sampling, we introduce a mosaic rendering technique.Comment: For a full resolution version of this paper, along with supplementary materials, please visit at http://www.Eyemaginary.com/Portfolio/Publications.htm

On substitution tilings and Delone sets without finite local complexity

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 sets. We then obtain several results on their ergodic-theoretic properties, notably absence of strong mixing and conditions for existence of eigenvalues, which have number-theoretic consequences. In particular, if the set of eigenvalues of the expansion matrix is totally non-Pisot, then the tiling dynamical system is weakly mixing. Further, we define the notion of rigidity for substitution tilings and demonstrate that the result of [Lee-Solomyak (2012)] on the equivalence of four properties: relatively dense discrete spectrum, being not weakly mixing, the Pisot family, and the Meyer set property, extends to the non-FLC case, if we assume rigidity instead.Comment: 36 pages, 3 figures; revision after the referee report, to appear in the Journal of Discrete and Continuous Dynamical Systems. Results unchanged, but substantial changes in organization of the paper; details and references adde

Minimum Convex Partitions and Maximum Empty Polytopes

Let $S$ be a set of $n$ points in $\mathbb{R}^d$. A Steiner convex partition is a tiling of ${\rm conv}(S)$ with empty convex bodies. For every integer $d$, we show that $S$ admits a Steiner convex partition with at most $\lceil (n-1)/d\rceil$ tiles. This bound is the best possible for points in general position in the plane, and it is best possible apart from constant factors in every fixed dimension $d\geq 3$. We also give the first constant-factor approximation algorithm for computing a minimum Steiner convex partition of a planar point set in general position. Establishing a tight lower bound for the maximum volume of a tile in a Steiner convex partition of any $n$ points in the unit cube is equivalent to a famous problem of Danzer and Rogers. It is conjectured that the volume of the largest tile is $\omega(1/n)$. Here we give a $(1-\varepsilon)$-approximation algorithm for computing the maximum volume of an empty convex body amidst $n$ given points in the $d$-dimensional unit box $[0,1]^d$.Comment: 16 pages, 4 figures; revised write-up with some running times improve