Tube formulas and self-similar tilings

Similar documents
Self-similar tilings and their complex dimensions. Erin P.J. Pearse erin/

Abstract of the Dissertation Complex Dimensions of Self-Similar Systems by

arxiv: v2 [math.mg] 25 May 2009

A TUBE FORMULA FOR THE KOCH SNOWFLAKE CURVE, WITH APPLICATIONS TO COMPLEX DIMENSIONS.

CANONICAL SELF-SIMILAR TILINGS BY IFS.

FRACTALS, DIMENSION, AND NONSMOOTH ANALYSIS ERIN PEARSE

Nonarchimedean Cantor set and string

Complex Dimensions of Self-Similar Systems A Dissertation submitted in partial satisfaction of the requirements for the degree of

An Introduction to the Theory of Complex Dimensions and Fractal Zeta Functions

Nature is an infinite sphere of which the center is everywhere and the circumference nowhere. Blaise Pascal

Fractal Strings and Multifractal Zeta Functions

Fractal Strings and Multifractal Zeta Functions

Fractal Geometry and Complex Dimensions in Metric Measure Spaces

USING THE RANDOM ITERATION ALGORITHM TO CREATE FRACTALS

Topological properties of Z p and Q p and Euclidean models

TOWARD ZETA FUNCTIONS AND COMPLEX DIMENSIONS OF MULTIFRACTALS

Curvature measures and fractals

The spectral decimation of the Laplacian on the Sierpinski gasket

Tree-adjoined spaces and the Hawaiian earring

FRACTAL GEOMETRY, DYNAMICAL SYSTEMS AND CHAOS

P-adic Functions - Part 1

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product

Fractals and Fractal Dimensions

Rational numbers with purely periodic beta-expansion. Boris Adamczeswki, C. Frougny, A. Siegel, W.Steiner

RIEMANNIAN GEOMETRY COMPACT METRIC SPACES. Jean BELLISSARD 1. Collaboration:

Self-similar fractals as boundaries of networks

THE CONTRACTION MAPPING THEOREM, II

Random measures, intersections, and applications

MAT1000 ASSIGNMENT 1. a k 3 k. x =

PROBLEMS. (b) (Polarization Identity) Show that in any inner product space

arxiv: v2 [math.ds] 9 Jun 2013

Self-similar fractals as boundaries of networks

Springer Monographs in Mathematics

S-adic sequences A bridge between dynamics, arithmetic, and geometry

LAPLACIANS COMPACT METRIC SPACES. Sponsoring. Jean BELLISSARD a. Collaboration:

18.175: Lecture 2 Extension theorems, random variables, distributions

THEOREMS, ETC., FOR MATH 515

Lecture 4 Lebesgue spaces and inequalities

Mid Term-1 : Practice problems

Mathematics for Economists

The small ball property in Banach spaces (quantitative results)

MATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5

Laplacians on Self-Similar Fractals and Their Spectral Zeta Functions: Complex Dynamics and Renormalization

MAT 771 FUNCTIONAL ANALYSIS HOMEWORK 3. (1) Let V be the vector space of all bounded or unbounded sequences of complex numbers.

Hausdorff Measure. Jimmy Briggs and Tim Tyree. December 3, 2016

Spectral Properties of an Operator-Fractal

RANDOM FIELDS AND GEOMETRY. Robert Adler and Jonathan Taylor

Proof: The coding of T (x) is the left shift of the coding of x. φ(t x) n = L if T n+1 (x) L

Fractals and Dimension

Minimal inequalities for an infinite relaxation of integer programs

INTERIOR COMPONENTS OF A TILE ASSOCIATED TO A QUADRATIC CANONICAL NUMBER SYSTEM

Simultaneous Accumulation Points to Sets of d-tuples

1. If 1, ω, ω 2, -----, ω 9 are the 10 th roots of unity, then (1 + ω) (1 + ω 2 ) (1 + ω 9 ) is A) 1 B) 1 C) 10 D) 0

Problem: A class of dynamical systems characterized by a fast divergence of the orbits. A paradigmatic example: the Arnold cat.

Math 320-2: Midterm 2 Practice Solutions Northwestern University, Winter 2015

Fractal zeta functions and geometric combinatorial problems for self-similar subsets of Z n.

Lebesgue Integration on R n

Spectral Triples on the Sierpinski Gasket

Normed & Inner Product Vector Spaces

NECESSARY CONDITIONS FOR WEIGHTED POINTWISE HARDY INEQUALITIES

Real Analysis Problems

Course 212: Academic Year Section 1: Metric Spaces

Eigenvalues of the Laplacian on domains with fractal boundary

JORDAN CONTENT. J(P, A) = {m(i k ); I k an interval of P contained in int(a)} J(P, A) = {m(i k ); I k an interval of P intersecting cl(a)}.

NONCOMMUTATIVE. GEOMETRY of FRACTALS

Algorithmic interpretations of fractal dimension. Anastasios Sidiropoulos (The Ohio State University) Vijay Sridhar (The Ohio State University)

Maths 212: Homework Solutions

(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define

ON THE STRUCTURES OF GENERATING ITERATED FUNCTION SYSTEMS OF CANTOR SETS

Convex Analysis and Economic Theory Winter 2018

PATH FUNCTIONALS OVER WASSERSTEIN SPACES. Giuseppe Buttazzo. Dipartimento di Matematica Università di Pisa.

Economics 204 Fall 2012 Problem Set 3 Suggested Solutions

MATH 566 LECTURE NOTES 6: NORMAL FAMILIES AND THE THEOREMS OF PICARD

Convex Sets and Minimal Sublinear Functions

Densely defined non-closable curl on topologically one-dimensional Dirichlet metric measure spaces

Fractals and iteration function systems II Complex systems simulation

Definable Extension Theorems in O-minimal Structures. Matthias Aschenbrenner University of California, Los Angeles

NATIONAL BOARD FOR HIGHER MATHEMATICS. Research Scholarships Screening Test. Saturday, January 20, Time Allowed: 150 Minutes Maximum Marks: 40

INTRODUCTION TO FRACTAL GEOMETRY

Tools from Lebesgue integration

b 0 + b 1 z b d z d

Lectures on fractal geometry and dynamics

Problem Set 2: Solutions Math 201A: Fall 2016

Line integrals of 1-forms on the Sierpinski gasket

Notation. General. Notation Description See. Sets, Functions, and Spaces. a b & a b The minimum and the maximum of a and b

An Introduction to Self Similar Structures

Introduction to Hausdorff Measure and Dimension

Measurable functions are approximately nice, even if look terrible.

Cones of measures. Tatiana Toro. University of Washington. Quantitative and Computational Aspects of Metric Geometry

VARIATIONAL PRINCIPLE FOR THE ENTROPY

i=1 β i,i.e. = β 1 x β x β 1 1 xβ d

Qualifying Exams I, 2014 Spring

INTRODUCTION TO MEASURE THEORY AND LEBESGUE INTEGRATION

MATH 202B - Problem Set 5

l(y j ) = 0 for all y j (1)

An introduction to Mathematical Theory of Control

Section 3.9. Matrix Norm

II - REAL ANALYSIS. This property gives us a way to extend the notion of content to finite unions of rectangles: we define

RANDOM FRACTAL STRINGS: THEIR ZETA FUNCTIONS, COMPLEX DIMENSIONS AND SPECTRAL ASYMPTOTICS

INTRODUCTION TO REAL ANALYTIC GEOMETRY

Transcription:

Tube formulas and self-similar tilings Erin P. J. Pearse erin-pearse@uiowa.edu Joint work with Michel L. Lapidus and Steffen Winter VIGRE Postdoctoral Fellow Department of Mathematics University of Iowa Workshop Fractals and Tilings Austrian Science Foundation FWF, in Strobl, Austria July 6 July 10, 2009 EPJP supported in part by NSF VIGRE grant DMS-0602242.

Introduction and basic terms Inner and outer tube formulas Definition: The outer ε-neighbourhood (ε-nbd) of a bounded open set A R d is A ε := {x A. dist(x, bd A) ε}.

Introduction and basic terms Inner and outer tube formulas Definition: The outer ε-neighbourhood (ε-nbd) of a bounded open set A R d is A ε := {x A. dist(x, bd A) ε}. An outer tube formula for A R d is an explicit formula for vol d (A ε ).

Introduction and basic terms Inner and outer tube formulas Definition: The outer ε-neighbourhood (ε-nbd) of a bounded open set A R d is A ε := {x A. dist(x, bd A) ε}. An outer tube formula for A R d is an explicit formula for vol d (A ε ). Definition: The inner ε-nbd of a bounded open set A R d is A ε := {x A. dist(x, A ) ε} = (A ) ε. An inner tube formula is an explicit formula for vol d (A ε ).

Introduction and basic terms How to compute the tube formula for a self-similar set? Use inner tube formula for A to find outer tube formula for A.

Introduction and basic terms How to compute the tube formula for a self-similar set? Use inner tube formula for A to find outer tube formula for A. (1) Obtain the components of A from the IFS. (2) Determine compatibility conditions. (3) Compute V(ε) = vol d ((A ) ε ) using complex dimensions.

Introduction and basic terms Self-similar sets in R d Definition Φ = {Φ 1,..., Φ J } is a self-similar system in R d iff Φ j (x) = r j M j x + t j, j = 1, 2,..., J where 0 < r j < 1, M j O(d), and t j R d, for each j.

Introduction and basic terms Self-similar sets in R d Definition Φ = {Φ 1,..., Φ J } is a self-similar system in R d iff Φ j (x) = r j M j x + t j, j = 1, 2,..., J where 0 < r j < 1, M j O(d), and t j R d, for each j. A self-similar set F R d is a fixed point of Φ J F = Φ(F) := Φ j (F). j=1

The canonical self-affine tiling Two tiling examples: Koch curve and Sierpinski gasket The Koch tiling and the Sierpinski gasket tiling Φ 1 (z) = ξz, Φ 2 (z) = (1 ξ)(z 1) + 1, for ξ = 1 2 + i 2 3 C. Φ 1 (x) = x 2 + p 1, Φ 2 (x) = x 2 + p 2, Φ 3 (x) = x 2 + p 3.

The canonical self-affine tiling Two tiling examples: Koch curve and Sierpinski gasket The Koch tiling and the Sierpinski gasket tiling Φ 1 (z) = ξz, Φ 2 (z) = (1 ξ)(z 1) + 1, for ξ = 1 2 + i 2 3 C. Φ 1 (x) = x 2 + p 1, Φ 2 (x) = x 2 + p 2, Φ 3 (x) = x 2 + p 3.

The canonical self-affine tiling Two tiling examples: Koch curve and Sierpinski gasket The Koch tiling and the Sierpinski gasket tiling Φ 1 (z) = ξz, Φ 2 (z) = (1 ξ)(z 1) + 1, for ξ = 1 2 + i 2 3 C. Φ 1 (x) = x 2 + p 1, Φ 2 (x) = x 2 + p 2, Φ 3 (x) = x 2 + p 3.

The canonical self-affine tiling Two tiling examples: Koch curve and Sierpinski gasket The Koch tiling and the Sierpinski gasket tiling Φ 1 (z) = ξz, Φ 2 (z) = (1 ξ)(z 1) + 1, for ξ = 1 2 + i 2 3 C. Φ 1 (x) = x 2 + p 1, Φ 2 (x) = x 2 + p 2, Φ 3 (x) = x 2 + p 3.

The canonical self-affine tiling Two tiling examples: Koch curve and Sierpinski gasket The Koch tiling and the Sierpinski gasket tiling Φ 1 (z) = ξz, Φ 2 (z) = (1 ξ)(z 1) + 1, for ξ = 1 2 + i 2 3 C. Φ 1 (x) = x 2 + p 1, Φ 2 (x) = x 2 + p 2, Φ 3 (x) = x 2 + p 3.

The canonical self-affine tiling Two tiling examples: Koch curve and Sierpinski gasket The Koch tiling and the Sierpinski gasket tiling Φ 1 (z) = ξz, Φ 2 (z) = (1 ξ)(z 1) + 1, for ξ = 1 2 + i 2 3 C. Φ 1 (x) = x 2 + p 1, Φ 2 (x) = x 2 + p 2, Φ 3 (x) = x 2 + p 3.

The canonical self-affine tiling Two tiling examples: Koch curve and Sierpinski gasket The Koch tiling and the Sierpinski gasket tiling Φ 1 (z) = ξz, Φ 2 (z) = (1 ξ)(z 1) + 1, for ξ = 1 2 + i 2 3 C. Φ 1 (x) = x 2 + p 1, Φ 2 (x) = x 2 + p 2, Φ 3 (x) = x 2 + p 3.

The canonical self-affine tiling Two tiling examples: Koch curve and Sierpinski gasket The Koch tiling and the Sierpinski gasket tiling Φ 1 (z) = ξz, Φ 2 (z) = (1 ξ)(z 1) + 1, for ξ = 1 2 + i 2 3 C. Φ 1 (x) = x 2 + p 1, Φ 2 (x) = x 2 + p 2, Φ 3 (x) = x 2 + p 3.

The canonical self-affine tiling Two tiling examples: Koch curve and Sierpinski gasket The Koch tiling and the Sierpinski gasket tiling Φ 1 (z) = ξz, Φ 2 (z) = (1 ξ)(z 1) + 1, for ξ = 1 2 + i 2 3 C. Φ 1 (x) = x 2 + p 1, Φ 2 (x) = x 2 + p 2, Φ 3 (x) = x 2 + p 3.

The canonical self-affine tiling Two tiling examples: Koch curve and Sierpinski gasket The Koch tiling and the Sierpinski gasket tiling Φ 1 (z) = ξz, Φ 2 (z) = (1 ξ)(z 1) + 1, for ξ = 1 2 + i 2 3 C. Φ 1 (x) = x 2 + p 1, Φ 2 (x) = x 2 + p 2, Φ 3 (x) = x 2 + p 3.

The canonical self-affine tiling Open tilings: definition, construction, and properties Tiling by open sets Definition: Let A = {A i } i N where A i R d are disjoint open sets. A is an open tiling of a compact set K R d iff K = i=1 Ai. The sets A i are called the tiles.

The canonical self-affine tiling Open tilings: definition, construction, and properties Tiling by open sets Definition: Let A = {A i } i N where A i R d are disjoint open sets. A is an open tiling of a compact set K R d iff K = i=1 Ai. The sets A i are called the tiles. Not a typical tiling: Only some compact set K F is tiled, not R d. Tiles occur at all scales. (Given ε > 0, there is a tile with diameter less than ε.) Tiles are open sets. No local finiteness is assumed.

The canonical self-affine tiling Open tilings: definition, construction, and properties Initiating the tiling construction For the construction to be possible, assume F satisfies the open set condition, and int F =.

The canonical self-affine tiling Open tilings: definition, construction, and properties Initiating the tiling construction For the construction to be possible, assume F satisfies the open set condition, and int F =. If O is a feasible open set for F, this means: 1 Φ j (O) Φ k (O) = for j k, 2 Φ j (O) O for each j, 3 F O, and 4 O Φ(O). First, construct a tiling of K := O. Later, worry about which K work for the tube formula.

The canonical self-affine tiling Tile and generators Each tile is the image of a generator Definition: The generators {G q } Q q=1 are the connected components of int(k \ Φ(K)). Some examples may have multiple generators.

The canonical self-affine tiling Tile and generators Each tile is the image of a generator Definition: The generators {G q } Q q=1 are the connected components of int(k \ Φ(K)). Definition: The self-affine tiling 1 associated with Φ and O is T = T (O) = {Φ w (G q ). w W, q = 1,..., Q}, where W := k=0 {1,..., N}k is all finite strings on {1,..., N}, and Φ w := Φ w1 Φ w2... Φ wn. Theorem: T (O) is an open tiling of K = O. Let T = R T R denote the union of the tiles. 1 The tiling construction works for self-affine sets, but tube formula technique is only valid for self-similar sets.

The canonical self-affine tiling Tile and generators How to pick a good O (or K) Theorem [Compatibility Theorem]: Let int F = satisfy OSC with feasible set O and associated tiling T (O). Then TFAE: 1 bd T = F. 2 bd K F. 3 bd(k \ Φ(K)) F. 4 bd G q F for all q Q. 5 F ε K = T ε for all ε 0. 6 F ε K = K ε K for all ε 0. So for a given Φ and F, check that one of 1 4 is satisfied. Then 5 6 ensure the inner/outer decomposition:

The canonical self-affine tiling Tile and generators How to pick a good O (or K) Specific possibilities: (1) Choose K = [F] and O = int K. Feasible iff int Φ j (K) Φ k (K) = for j k. (Tileset condition) In this case, int F iff F is convex. (Nontriviality condition)

The canonical self-affine tiling Tile and generators How to pick a good O (or K) Specific possibilities: (1) Choose K = [F] and O = int K. Feasible iff int Φ j (K) Φ k (K) = for j k. (Tileset condition) In this case, int F iff F is convex. (Nontriviality condition) (2) Let U be the unbounded component of F. Choose K = U (the envelope of F) and O = int K. For the envelope, one always has bd K F K [F], and K is convex iff K = [F].

The canonical self-affine tiling Tile and generators How to pick a good O (or K) Specific possibilities: (1) Choose K = [F] and O = int K. Feasible iff int Φ j (K) Φ k (K) = for j k. (Tileset condition) In this case, int F iff F is convex. (Nontriviality condition) (2) Let U be the unbounded component of F. Choose K = U (the envelope of F) and O = int K. For the envelope, one always has bd K F K [F], and K is convex iff K = [F].

Computation of the tube formula How to compute the tube formula Suppose you have Φ satisfying OSC, with int F =, and a feasible open set O satisfying the compatibility theorem. What is the tube formula? We compute V(ε) = vol d (T ε ), the inner tube formula for the tiling. Wlog, suppose there is only one generator.

Computation of the tube formula The scaling zeta function: scales and sizes The scaling zeta function Definition: Let r w = r w1 r w2... r wn be the scaling ratio of Φ w. The scaling zeta function is given by the scaling ratios of Φ via ζ s (s) = w W r s w = 1 1, for s C. N j=1 rs j ζ s records the sizes (and multiplicities) of the tiles T = {Φ w (G)}.

Computation of the tube formula The scaling zeta function: scales and sizes The scaling zeta function Definition: Let r w = r w1 r w2... r wn be the scaling ratio of Φ w. The scaling zeta function is given by the scaling ratios of Φ via ζ s (s) = w W r s w = 1 1, for s C. N j=1 rs j ζ s records the sizes (and multiplicities) of the tiles T = {Φ w (G)}. Definition: The complex dimensions of Φ are D s := {poles of ζ s }. Theorem: dim M (F) = sup ω D s Re ω = max{ω D s. ω R}. ζ s is the Mellin transform of a measure η s : ζ s (s) = 0 x s η s (dx), η s := w W δ r 1 w.

Computation of the tube formula The scaling zeta function: scales and sizes Converting scales to sizes Definition: The inradius of A R d is the radius of the largest metric ball contained in A. Equivalently, ρ(a) := inf{ε > 0. A ε = A}. For A = G, write g := ρ(g). The tile Φ w (G) has inradius r w g.

Computation of the tube formula The scaling zeta function: scales and sizes Converting scales to sizes Definition: The inradius of A R d is the radius of the largest metric ball contained in A. Equivalently, ρ(a) := inf{ε > 0. A ε = A}. For A = G, write g := ρ(g). The tile Φ w (G) has inradius r w g. Definition: G is diphase iff there are constants κ k so that d 1 V G (ε) = κ k ε d k, 0 ε g. k=0 Theorem: If A is convex, then vol d (A ε ) = d 1 k=0 κ kε d k for ε 0. Here, κ k = µ k (A) vol d-k (B d k ), and µ k are the intrinsic volumes.

Computation of the tube formula A simplified form of the tube formula for self-similar tilings The tube formula for self-similar tilings Theorem (Tube formula for simple diphase self-similar tilings) Suppose T has a single diphase generator and ζ s has only simple poles. Then for 0 ε g, V T (ε) = ω D s res (ζ s ; ω) where D s := {poles of ζ s }. d g ω k ω k κ d 1 kε d ω + κ k ζ s (k)ε d k, k=0 k=0

Computation of the tube formula A simplified form of the tube formula for self-similar tilings The tube formula for self-similar tilings Theorem (Tube formula for simple diphase self-similar tilings) Suppose T has a single diphase generator and ζ s has only simple poles. Then for 0 ε g, V T (ε) = d c ω ε d ω g ω k, for c ω = res (ζ s ; ω) ω k κ k, ω D s {0,1,...,d 1} where D s := {poles of ζ s }. Compare to the Steiner formula: d 1 vol d (A ε ) = κ k ε d k for ε 0. k=0 k=0

Computation of the tube formula The general form of the tube formula for self-similar tilings Geometric zeta function and Steiner-like sets The geometric zeta function of T with one generator is ζ T (ε, s) := ζ s (s)ε d s d k=0 g s k s k κ k, ζ s (s) := w W r s w, and it has poles D T :={ω... ζ T (ε, s) has a pole at s = ω} =D s {0, 1,..., d 1}. These are the complex dimensions of the tiling T.

Computation of the tube formula The general form of the tube formula for self-similar tilings Geometric zeta function and Steiner-like sets The geometric zeta function of T with one generator is ζ T (ε, s) := ζ s (s)ε d s d k=0 g s k s k κ k(g, ε), ζ s (s) := w W r s w, and it has poles D T := {0, 1,..., d 1} D s. Definition: A bounded open set G is Steiner-like iff d V G (ε) = κ k (G, ε)ε d k, 0 ε g, k=0 where κ k (G, ) is bounded and locally integrable and lim ε 0 + κ k(g, ε) exists, and is positive and finite.

Computation of the tube formula The general form of the tube formula for self-similar tilings The tube formula for self-similar tilings Theorem: Suppose T has a single Steiner-like generator. Then V T (ε) = res (ζ T ; ω), for 0 ε g. ω D T The End

Computation of the tube formula The general form of the tube formula for self-similar tilings Tube formulas and self-similar tilings Erin P. J. Pearse erin-pearse@uiowa.edu Joint work with Michel L. Lapidus and Steffen Winter VIGRE Postdoctoral Fellow Department of Mathematics University of Iowa Workshop Fractals and Tilings Austrian Science Foundation FWF, in Strobl, Austria July 6 July 10, 2009 EPJP supported in part by NSF VIGRE grant DMS-0602242.

Supplementary material Fractal strings Fractal strings: the case d = 1 Definition A fractal string is simply a bounded open subset L R, so L consists of L := {L n } n=1, where each L n is an open interval.

Supplementary material Fractal strings Fractal strings: the case d = 1 Definition A fractal string is simply a bounded open subset L R, so L consists of L := {L n } n=1, where each L n is an open interval. Essential strategy of fractal strings: study fractal subsets of R via their complements. L is some fractal set we want to study.

Supplementary material Fractal strings Fractal strings: the case d = 1 Definition A fractal string is simply a bounded open subset L R, so L consists of L := {L n } n=1, where each L n is an open interval. Essential strategy of fractal strings: study fractal subsets of R via their complements. L is some fractal set we want to study. L :={l n } n=1, l n <. n=1 l 1 l 2... > 0.

Supplementary material Fractal strings Fractal strings: the case d = 1 Definition A fractal string is simply a bounded open subset L R, so L consists of L := {L n } n=1, where each L n is an open interval. When L is a self-similar set, the fractal string L is a self-similar tiling in R d, d = 1. Fractal strings came first the self-similar tiling is an extension of this theory to R d.

Supplementary material Fractal strings ζ L relates geometric and arithmetic properties Definition The geometric zeta function of a fractal string L is ζ L (s) = l s n = n=1 g s q 1 rj s, s C. Theorem: D = inf{σ 0. n=1 lσ n < }.

Supplementary material Fractal strings ζ L relates geometric and arithmetic properties Definition The geometric zeta function of a fractal string L is ζ L (s) = l s n = n=1 g s q 1 rj s, s C. Theorem: D = inf{σ 0. n=1 lσ n < }. Definition Accordingly, the complex dimensions of L are D L = {ω C. ζ L has a pole at ω}.

Supplementary material The tube formula for fractal strings The (inner) tube formula for fractal strings Theorem: For a self-similar fractal string L, V(L ε ) = ω D L (2ε)1 ω ω(1 ω) res (ζ L(s); ω) 2ε. (Sum is over the set of complex dimensions.)

Supplementary material The tube formula for fractal strings The (inner) tube formula for fractal strings Theorem: For a self-similar fractal string L, V(L ε ) = c ω ε 1 ω. ω D L {0} Minkowski content is M = lim ε 0+ V(L ε )ε (1 D), when it exists. Tube formula shows when string is measurable.

Supplementary material The tube formula for fractal strings The (inner) tube formula for fractal strings Theorem: For a self-similar fractal string L, V(L ε ) = c ω ε 1 ω. ω D L {0} Spectral asymptotics: the eigenvalue counting function is N ν (x) = x vol 1 (L) + res (ζ L ; D) ψ(x) + error, xd+inp { n Z ζ(d + inp) D+inp ψ(x) =, or ζ(d) xd D. where Recall: res (ζ L ; D) is related to D-dimnl volume of L.

Supplementary material The tube formula for fractal strings V(T ε ) = ω D s k=0 V(T ε ) = res (ζ T (ε, s); ω). ω D T d res (ζ s ; ω) g ω k ε d ω d 1 κ k ω k + g k κ k ζ s (k)ε d k. k=0 Compare to strings: V(L ε ) = c ω ε 1 ω. ω D L {0}

Supplementary material Examples of fractal strings CS is the complement of the Cantor set in [0, 1] CS = ζ CS (s) = { 1 3, 1 9, 1 9, 1 27, 1 27, 1 27, 1 } 27,..., 2 k 3 (k+1)s = k=0 3 s 1 2 3 s. The complex dimensions of CS (poles of ζ CS ) are D CS = {D + inp. n Z}, where D = log 3 2, i = 1, p = 2π/ log 3

Supplementary material Examples of fractal strings CS is an example of a lattice string The complex dimensions D CS.

Supplementary material Examples of fractal strings Nonlattice example: the Golden String. Let r 1 = 2 1 and r 2 = 2 φ, where φ = 1 2 (1 + 5) is the golden ratio. The Golden String is a nonlattice 1 string with lengths {( ) } n GS = {r1 k k rn k 2 }. k n = 0, 1, 2,... ( n k) indicates the multiplicity of r k 1 r n k 2. ζ GS (s) = 1 1 2 s 2 φs, D GS are the solutions of the transcendental equation 2 ω + 2 φω = 1 (ω D),

Supplementary material Examples of fractal strings Example 2: the Golden String.

Supplementary material Examples of fractal strings Example 2: the Golden String. The Golden String is a limit of lattice strings via Diophantine approximation. 2 1, 3 2, 5 3, 8 5, 13 8, 21 13, 34 21, 55,... φ. 34 For any such approximation, r 1 and r 2 are integer powers of some common base r. r 1 = r k 1, r 2 = r k 2, k 1, k 2 N

Supplementary material Examples of fractal strings Example 2: the Golden String.

Supplementary material Examples of fractal strings Example 2: the Golden String.

Supplementary material Examples of fractal strings Lattice vs. Nonlattice For self-similar strings, a dichotomy exists. The lattice case: {log r 1,..., log r J } are rationally dependent. Complex dimns lie on finitely many vert lines. There is a row of dimns on Re s = D. Infinitely many complex dimensions have real part D. L is not Minkowski measurable. The Cantor String CS is a lattice string.

Supplementary material Examples of fractal strings Lattice vs. Nonlattice For self-similar strings, a dichotomy exists. The nonlattice case: Some log r j are rationally independent. Complex dimns are scattered in a horizontally bounded strip [σ l, D]. Re ω appears dense in the interval [σ l, D]. D is the only dim with Re ω = d. L is Minkowski measurable. The golden string GS is a nonlattice string.

Supplementary material Minkowski measurability and dimension Minkowski dimension is box-counting dimension Definition The Minkowski dimension of the set Ω R d D = dim M Ω = lim ε 0 + log M ε (Ω) log ε = inf{t 0. V(Ω ε ) = O ( ε d t) as ε 0 + }. For a string Ω = L, the Minkowski dimension is D = dim M L.

Supplementary material Minkowski measurability and dimension Minkowski measurability Definition The set Ω is Minkowski measurable if and only if the limit exists, and 0 < M <. M = M(D; Ω) = lim ε 0+ V(Ω ε)ε (d D) A string L is measurable iff L is. M is the Minkowski content. Measurable = Minkowski measurable in this talk. For fractal strings: V(L ε ) = 2ε + l n. l n>2ε l n 2ε

Supplementary material Minkowski measurability and dimension Using V(Ω ε ) to see Minkowski measurability

Supplementary material Minkowski measurability and dimension Using V(Ω ε ) to see Minkowski measurability

Supplementary material Minkowski measurability and dimension Using V(Ω ε ) to see Minkowski measurability

Supplementary material Minkowski measurability and dimension Using V(Ω ε ) to see Minkowski measurability

Supplementary material Minkowski measurability and dimension Using V(Ω ε ) to see Minkowski measurability

Supplementary material Minkowski measurability and dimension Using V(Ω ε ) to see Minkowski measurability Complex dimensions with real part D induce oscillations in V(L ε ) of order D ( geometric oscillations ). This means lim ε 0 + V(L ε )ε (1 D) cannot exist; it contains terms of the form c ω ε Im(ω)i = c ω e Im(ω)i log ε.