A separated net is a set of points which is relatively dense and uniformly discrete (another name for a Delone set). We are dealing with tilings and separated nets in Euclidean spaces and with the question whether a given separated net is biLipschitz to the integer lattice. In this paper we show, as an answer to a question of Burago and Kleiner, that the net that is obtained form the Penrose tiling is biLipschitz to the integer lattice.
Deep Dive into The net created from the Penrose tiling is biLipschitz to the integer lattice.
A separated net is a set of points which is relatively dense and uniformly discrete (another name for a Delone set). We are dealing with tilings and separated nets in Euclidean spaces and with the question whether a given separated net is biLipschitz to the integer lattice. In this paper we show, as an answer to a question of Burago and Kleiner, that the net that is obtained form the Penrose tiling is biLipschitz to the integer lattice.
Definition 1.1. A separated net is a discrete set Y ⊆ R 2 with two parameters c 1 , c 2 > 0 such that for every x, y ∈ Y d(x, y) ≥ c 1 , and for every x ∈ R 2 there is a y ∈ Y with d(x, y) ≤ c 2 .
Remark 1.2. For information about tilings see [GS87].
Let τ 1 be the Penrose tiling on R 2 [G77] (using kites and darts) with edges of lengths 1 and φ, where φ is the golden ratio 1+ √ 5
2 . Let U be a square of the form [j 1 , j 1 + l] × [j 2 , j 2 + l] where l = 2 i , i, j 1 , j 2 ∈ N.
Notice that when we have a tiling of the plane (so that the diameter of its tiles is bounded) we can produce a separated net from it. We do it by placing one point in each tile, and remember to maintain the minimal distance property from (1.1). Obviously, by placing the points differently in the tiles we will get different separated nets, but all these nets will be in the same biLipschitz equivalence class. Thus we can say that every tiling creates a separated net. Let Y be the separated net which is created by the tiling τ 1 . For a number ρ > 0 we define as in [BK02] (1)
Our objective is to show that there is a ρ > 0 such that the product ∞ i=1 E ρ (2 i ) converges. Then, by [BK02], we conclude that Y is biLipschitz to Z 2 .
Assume that we have a Penrose tiling of the plane σ 1 . Let σ n be the tiling that is obtained from applying the deflation operation (see [G77], [B81]) to σ 1 n-1 times. Let A ⊆ R 2 be a set which is covered by exactly K 1 half kites and D 1 half darts from the tiling σ 1 (we consider half with respect to the symmetry axis). In other words, if B is a half kite or a half dart in σ 1 then A ∩ B = ∅ or B ⊆ A. Denote by K n and D n the number of half kites and half darts in σ n respectively that are wholly contained in A. We will show that the ratio Kn Dn converges to φ = 1+ √ 5 2
when n approaches infinity.
Proposition 2.1. For every n ≥ 3
Proof. By using the deflation operation on a half kite and a half dart one can see that every half kite is divided into two half kites and one half dart, and every half dart is divided into one half kite and one half dart [G77]. From this rule we obtain the following recursive formulas:
x+1 (as in [P79]). Notice that for every x, 1 ≤ f (x) ≤ 2. Then for every x, y ∈ Rng(f ):
Hence f is a contraction mapping with a Lipschitz constant 1 4 (< 1). Since [1,2] is a complete space, according to the contraction mapping theorem, f has a unique fixed point p, and for every
Now let τ 1 be the Penrose tiling on R 2 with edges of lengths 1 and φ. Let Y be the separated net which is created (as described in (1)) by the tiling τ 1 . Let U be a square with an edge of length l = 2 i as defined above. Denote by K and D the numbers of points in U ∩ Y that are obtained from kites and darts respectively (every point in Y is obtained from a dart or a kite in τ 1 ).
Proposition 2.2. For i ≥ 50
. Let τ 2 be the tiling of R 2 which is obtained after m 2 inflations (see [G77], [B81]) of τ 1 . Now look at the tiling τ 2 and define k 2 and d 2 to be the number of half kites and half darts respectively, which are wholly contained in U, and let V be the area which is covered by these k 2 + d 2 shapes. In a similar way we define K 2 and D 2 to be the number of half kites and half darts respectively, that intersect with U, and let W be the area which is covered by these K 2 + D 2 shapes. First, lets look at V. Notice that if we perform m 2 iterations of deflation on τ 2 , we’ll go back to τ 1 . Denote by k 1 and d 1 the number of half kites and half darts respectively, from τ 1 , which are wholly contained in V. Then those k 1 + d 1 shapes are exactly the shapes that are obtained from the k 2 + d 2 shapes of τ 2 after m 2 deflations. By (2.1) we conclude that
Now lets look at the area of W -V. Notice that we can bound K D as follows:
(3)
Since τ 2 is the tiling that is obtained by m 2 inflations on τ 1 , the length of a long edge of a tile in τ 2 is φ ⌊ m 2 ⌋ +1 . Simple geometry shows that this is also the diameter of a tile in τ 2 . Denote this number by a. By the definition of V and W we conclude that the distance between U and V, and between U and W, can’t be more than a. That is V contains a square Ṽ with an edge of length l -2a, and W is contained in a square W with an edge of length l + 2a. From these estimations we get bounds for the areas of V and W -V:
Here we can see that the area of W -V is insignificant in comparison to the area of V, when i is large. We’ll use this later.
Denote by ψ the area of the tile of the dart in the tiling τ 1 . Then the kite’s area is ψφ. By ( 4)
In order to estimate the difference between the ratio K D and φ, we’ll first estimate d 1 :
V is covered by k 1 half kites and d 1 half darts, and by ( 2), the ratio k 1 d 1 is very close to φ. We also know that the ratio between the areas of the shapes is exactly φ. Therefore:
Thus:
and in a similar way:
In order to choose ρ correctly, we’ll assume that the ratio K D is exactly φ, and that the K + D s
…(Full text truncated)…
This content is AI-processed based on ArXiv data.