Minkowski content and fractal curvatures of self-similar tilings and generator formulas for self-similar sets

We study Minkowski contents and fractal curvatures of arbitrary self-similar tilings (constructed on a feasible open set of an IFS) and the general relations to the corresponding functionals for self-similar sets. In particular, we characterize the situation, when these functionals coincide. In this case, the Minkowski content and the fractal curvatures of a self-similar set can be expressed completely in terms of the volume function or curvature data, respectively, of the generator of the tiling. In special cases such formulas have been obtained recently using tube formulas and complex dimensions or as a corollary to results on self-conformal sets. Our approach based on the classical Renewal Theorem is simpler and works for a much larger class of self-similar sets and tilings. In fact, generator type formulas are obtained for essentially all self-similar sets, when suitable volume functions (and curvature functions, respectively) related to the generator are used. We also strengthen known results on the Minkowski measurability of self-similar sets, in particular on the question of non-measurability in the lattice case.     

Quasicrystallic Tilings and Projection Method

Basic notions related to quasiperiodic tilings and Delone sets in Eucledean space are discussed. It is shown how the cut and project method of constructing them is used to calculate their spectra. Special attention is paid to self-similar tilings and the way one can obtain one-dimensional substitutional tilings by the projection scheme. Bibliography: 18 titles.     

Tube Formulas and Complex Dimensions of Self-Similar Tilings

We use the self-similar tilings constructed in (Pearse in Indiana Univ. Math J. 56(6):3151–3169, 2007) to define a generating function for the geometry of a self-similar set in Euclidean space. This tubularzeta function encodes scaling and curvature properties related to the complement of the fractal set, and the associated system of mappings. This allows one to obtain the complex dimensions of the self-similar tiling as the poles of the tubularzeta function and hence develop a tube formula for self-similar tilings in ℝ^d. The resulting power series in εis a fractal extension of Steiner’s classical tube formula for convex bodies K⊆ℝ ^d . Our sum has coefficients related to the curvatures of the tiling, and contains terms for each integer i=0,1,…,d−1, just as Steiner’s does. However, our formula also contains a term for each complex dimension. This provides further justification for the term “complex dimension”. It also extends several aspects of the theory of fractal strings to higher dimensions and sheds new light on the tube formula for fractals strings obtained in (Lapidus and van Frankenhuijsen in Fractal Geometry, Complex Dimensions and Zeta Functions: Geometry and Spectra of Fractal Strings, 2006).     

Self-Similarity in Harmonic Analysis

This is a survey of recent work involving concepts of self-similarity that relate to harmonic analysis. Perhaps the main theme is the question: how does the fractal or self-similar nature of an object express itself on the Fourier transform side? A wide range of related topics are discussed, including self-similar measures and distributions, fractal Plancherel theorems, L^p dimensions and densities of measures, multiperiodic functions and their asymptotic behavior, convolution equations with self-similar measures, self-similar tilings, and the development of self-similar analysis on stratified nilpotent Lie groups.     

A primer of substitution tilings of the Euclidean plane

This paper is intended to provide an introduction to the theory of substitution tilings. For our purposes, tiling substitution rules are divided into two broad classes: geometric and combinatorial. Geometric substitution tilings include self-similar tilings such as the well-known Penrose tilings; for this class there is a substantial body of research in the literature. Combinatorial substitutions are just beginning to be examined, and some of what we present here is new. We give numerous examples, mention selected major results, discuss connections between the two classes of substitutions, include current research perspectives and questions, and provide an extensive bibliography. Although the author attempts to represent the field as a whole, the paper is not an exhaustive survey, and she apologizes for any important omissions.     

A characterization of self-similar measures

For a graph directed self-similar set, we investigate a list of invariant self-similar measures. In particular, the existence of the local dimension of the associated self-similar measure is determined. Consequently, the multifractal decomposition of the graph directed self-similar set can be formulated under the open set condition. This give a positive answer to a question posed by Edgar and Mauldin, as well as Olsen.     

A characterization of self-similar measures

For a graph directed self-similar set, we investigate a list of invariant self-similar measures. In particular, the existence of the local dimension of the associated self-similar measure is determined. Consequently, the multifractal decomposition of the graph directed self-similar set can be formulated under the open set condition. This give a positive answer to a question posed by Edgar and Mauldin, as well as Olsen.     

MULTIRESOLUTION ANALYSIS, SELF-SIMILAR TILINGS AND HAAR WAVELETS ON THE HEISENBERG GROUP

In this article, the properties of multiresolution analysis and self-similar tilings on the Heisenberg group are studied. Moreover, we establish a theory to construct an orthonormal Haar wavelet base in L^2（H^d） by using self-similar tilings for the acceptable dilations on the Heisenberg group.     

Fractal Penrose tilings I. Construction and matching rules

Summary Quasiperiodic tilings of kite-and-dart type, widely used as models for quasicrystals with decagonal symmetry, are constructed by means of somewhat artificial matching rules for the tiles. The proof of aperiodicity uses a self-similarity property, or inflation procedure, which requires drawing auxiliary lines. We introduce a modification of the kite-and-dart tilings which comes very naturally with both properties: the tiles are strictly self-similar, and their fractal boundaries provide perfect matching rules.     

Detecting Combinatorial Hierarchy in Tilings Using Derived Voronoi Tessellations

Abstract. Tilings of R ² can display hierarchy similar to that seen in the limit sequences of substitutions. Self-similarity for tilings has been used as the standard generalization, but this viewpoint is limited because such tilings are analogous to limit points of constant-length substitutions. To generalize limit points of non-constant-length substitutions, we define hierarchy for infinite, labelled graphs, then extend this definition to tilings via their dual graphs. Examples of combinatorially substitutive tilings that are not self-similar are given. We then find a sufficient condition for detecting combinatorial hierarchy that is motivated by the characterization by Durand of substitutive sequences. That characterization relies upon the construction of the ``derived sequence'—a recoding in terms of reappearances of an initial block. Following this, we define the ``derived Vorono? tiling'—a retiling in terms of reappearances of an initial patch of tiles. Using derived Vorono? tilings, we obtain a sufficient condition for a tiling to be combinatorially substitutive.     

Detecting Combinatorial Hierarchy in Tilings Using Derived Voronoi Tessellations

   Abstract. Tilings of R ² can display hierarchy similar to that seen in the limit sequences of substitutions. Self-similarity for tilings has been used as the standard generalization, but this viewpoint is limited because such tilings are analogous to limit points of constant-length substitutions. To generalize limit points of non-constant-length substitutions, we define hierarchy for infinite, labelled graphs, then extend this definition to tilings via their dual graphs. Examples of combinatorially substitutive tilings that are not self-similar are given. We then find a sufficient condition for detecting combinatorial hierarchy that is motivated by the characterization by Durand of substitutive sequences. That characterization relies upon the construction of the ``derived sequence'—a recoding in terms of reappearances of an initial block. Following this, we define the ``derived Vorono? tiling'—a retiling in terms of reappearances of an initial patch of tiles. Using derived Vorono? tilings, we obtain a sufficient condition for a tiling to be combinatorially substitutive.     

Linear Repetitivity, I. Uniform Subadditive Ergodic Theorems and Applications

This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive ergodic theorems on tilings. The results of this paper can be applied in the study of both random operators and lattice gas models on tilings. Received July 19, 2000, and in revised form January 30, 2001. Online publication July 25, 2001.     

A Framework for the Construction of Self-replicating Tilings

Dekking (Adv. Math. 44:78–104, 1982; J. Comb. Theory Ser. A 32:315–320, 1982) provided an important method to compute the boundaries of lattice rep-tiles as a ‘recurrent set’ on a free group of a finite alphabet. That is, those tilings are generated by lattice translations of a single tile, and there is an expanding linear map that carries tiles to unions of tiles. The boundary of the tile is identified with a sequence of words in the alphabet obtained from an expanding endomorphism (substitution) on the alphabet. In this paper, Dekking’s construction is generalized to address tilings with more than one tile, and to have the elements of the tilings be generated by both translation and rotations. Examples that fall within the scope of our main result include self-replicating multi-tiles, self-replicating tiles for crystallographic tilings and aperiodic tilings.     

The boundary characteristic and Pick's theorem in the Archimedean planar tilings

The tiling of the plane by unit squares is only one of the 11 Archimedean tilings which use regular polygons and have only one type of vertex. In this paper, the boundary characteristic of a lattice polygon is defined for every Archimedean tiling, and related enumeration formulae are found. Pick's theorem (on the area of a lattice polygon in the tilling by squares) is then generalized for lattice polygons in each of the Archimedean tilings, by enumerating the number of tiles of each type in the polygon.     

Variations on Tilings in the Manhattan Metric

We investigate tilings of the integer lattice in the Euclidean n-dimensional space. The tiles considered here are the union of spheres defined by the Manhattan metric. We give a necessary condition for the existence of such a tiling for Z ⁿ when n 2. We prove that this condition is sufficient when n=2. Finally, we give some tilings of Z ⁿ when n 3.     

MEASURES AND THEIR DIMENSION SPECTRUMS FOR COOKIE-CUTTER SETS IN R~d

0. IntroductionMany theoretical physicists and mathematicians have studied the Hausdorff dimensions,measures and multifractal decompositions of fractals and obtained a lot of satisfactory results. Particularlyl there hajs given thorough and detailed study for self-similar fractals(of. e.g. [1--7]). mom the dynamical system point of view self-similar sets are regarded asthe attractors of iterated function systems consisting of self-similar cofltraction mappings.However, the researches for measu…     

Monotone labelings in polygonal tilings

Labeling the vertices of a finite sequence of polygonal tilings with fewest monotonicity violations enables to represent the tilings by merely specifying sets of vertices—the sequences of their appearance results from the labels. Eventually, this allows a lossless data compression for the sequence of tilings.The existence and computation of suitable labelings is derived from matching and graph colorings which induce an order on the tilings. This order is series-parallel on each individual tiling.     

An optimal algorithm to generate tilings

We produce an algorithm that is optimal with respect to both space and execution time to generate all the lozenge (or domino) tilings of a hole-free, general-shape domain given as input.We first recall some useful results, namely the distributive lattice structure of the space of tilings and Thurston's algorithm for constructing a particular tiling. We then describe our algorithm and study its complexity.     

Domino tilings of the expanded Aztec diamond

The expanded Aztec diamond is a generalized version of the Aztec diamond, with an arbitrary number of long columns and long rows in the middle. In this paper, we count the number of domino tilings of the expanded Aztec diamond. The exact number of domino tilings is given by recurrence relations of state matrices by virtue of the state matrix recursion algorithm, recently developed by the author to solve various two-dimensional regular lattice model enumeration problems.     

Removable sets for homogeneous linear partial differential equations in Carnot groups

Let L be a homogeneous left-invariant differential operator on a Carnot group. Assume that both L and L^t are hypoelliptic. We study the removable sets for L-solutions. We give precise conditions in terms of the Carnot- Caratheodory Hausdorff dimension for the removability for L-solutions under several auxiliary integrability or regularity hypotheses. In some cases, our criteria are sharp on the level of the relevant Hausdorff measure. One of the main ingredients in our proof is the use of novel local self-similar tilings in Carnot groups.