This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Intersections of Cantor sets derived from Complex Radix Expansions

Neil MacVicar
Abstract.

Let CC be the attractor of the IFS {fd(z)=(n+i)1(z+d):dD}\{f_{d}(z)=(-n+i)^{-1}(z+d):d\in D\}, D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\} and let dim\dim denote the box-counting dimension. It is known that for all λ[0,1]\lambda\in[0,1], that the set of complex numbers α\alpha for which dim(C(C+α))=λdim(C)\dim(C\cap(C+\alpha))=\lambda\dim(C) is dense in the set of α\alpha for which C(C+α)C\cap(C+\alpha)\neq\emptyset when dn2/2d\leq n^{2}/2 for all dDd\in D and |δδ|>n|\delta-\delta^{{}^{\prime}}|>n for all δδDD\delta\neq\delta^{{}^{\prime}}\in D-D. We show that this result still holds when we replace |δδ|>n|\delta-\delta^{{}^{\prime}}|>n with |δδ|>1|\delta-\delta^{{}^{\prime}}|>1. In fact, for sufficiently large nn, the result even holds when we remove the assumption dn2/2d\leq n^{2}/2 and replace |δδ|>n|\delta-\delta^{{}^{\prime}}|>n by |δδ|>2|\delta-\delta^{{}^{\prime}}|>2. Additionally, we make similar statements where dim\dim denotes the Hausdorff dimension or packing dimension. Our insights also find application in classifying the self-similarity of C(C+α)C\cap(C+\alpha). Namely we connect the occurrence of self-similarity to the notion of strongly eventually periodic sequences seen for analogous objects on the real line. We also provide a new proof of a result of W. Gilbert that inspired this work.

1. Introduction

Given a metric space (X,d)(X,d), a function f:XXf:X\rightarrow X is a contraction if there exists a real number c(0,1)c\in(0,1) such that

(1) d(f(x),f(y))cd(x,y)d(f(x),f(y))\leq cd(x,y)

for all x,yXx,y\in X. We call cc the contraction factor. Given a finite collection of contractions {f1,f2,,fN}\{f_{1},f_{2},\ldots,f_{N}\} on a complete metric space XX, called an iterated function system (IFS), there exists a unique compact set AXA\subset X that satisfies i=1Nfi(A)=A\cup_{i=1}^{N}f_{i}(A)=A [9]. The set AA is called the attractor of the IFS. A contraction is called a similarity if we have equality in (1). The attractor of an IFS is called self-similar when all the contractions are similarities. Many examples of self-similar sets are fractals. That is, they exhibit non-integer Hausdorff dimension. For example, the middle third Cantor set C3C_{3} is the attractor of the IFS {xx/3,xx/3+2/3}\{x\mapsto x/3,x\mapsto x/3+2/3\} and has Hausdorff dimension log2/log3\log{2}/\log{3}.

The intersection of a self-similar set and one of its translates has been studied extensively on the unit interval. The literature includes, but is surely not limited to, [1], [2], [8], [13], [14], [15], [16], [17], [18], [19], [20], [21], [24], and [25]. These papers consider the intersection’s cardinality, Hausdorff and box-counting dimensions, and classify when the intersection is also a self-similar set. The structure of these intersections in higher dimensions has received less attention. This paper presents results similar to those that hold on the unit interval for subsets of the complex plane.

Consider the following property of the middle third Cantor set proved by Davis and Hu in [1]. Let dimHX\dim_{H}X denote Hausdorff dimension of a set XmX\subset\mathbb{R}^{m}. See Definition 2.1 to recall how Hausdorff dimension is formulated. Let FF be the set of real numbers α\alpha for which C3(C3+α)C_{3}\cap(C_{3}+\alpha) is nonempty. The level sets of the function from FF to [0,log2/log3][0,\log{2}/\log{3}] given by αdimH(C3(C3+α))\alpha\mapsto\dim_{H}(C_{3}\cap(C_{3}+\alpha)) is dense in FF. Pedersen and Shaw proved a result similar to that of Davis and Hu for the attractor of a set of similarities defined on the complex plane using the box-counting dimension instead of the Hausdorff dimension [22]. To describe the IFS, fix a positive integer n2n\geq 2, let b:=n+ib:=-n+i and let D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\}. The IFS studied by Pedersen and Shaw in [22] is the collection of functions fd:f_{d}:\mathbb{C}\rightarrow\mathbb{C} given by fd(z)=b1(z+d)f_{d}(z)=b^{-1}(z+d) where dDd\in D.

The choices of factor n+i-n+i and digits {0,1,,n2}\{0,1,\ldots,n^{2}\} are special. The properties of this pairing have been studied in several papers ([5], [6], [10], [11], [12]). We state a theorem of Katai and Szabo which captures why it is of interest ([11]).

Theorem 1.1 (I. Katai, J. Szabo, [11], theorem 1).

Given a Gaussian integer bb, every Gaussian integer gg can be uniquely written as

(2) g=λ0+λ1b++λkbk.g=\lambda_{0}+\lambda_{1}b+\ldots+\lambda_{k}b^{k}.

with λj{0,1,2,,|b|21}\lambda_{j}\in\{0,1,2,\ldots,|b|^{2}-1\} if and only if Re(b)<0\operatorname{Re}(b)<0 and Im(b)=±1\operatorname{Im}(b)=\pm 1.

In other words, the base must be of the form b=n±ib=-n\pm i where nn is a positive integer and the set of digits is {0,1,,n2}\{0,1,\ldots,n^{2}\}. This result can be used to prove a result about complex radix expansions, found in [11].

Definition 1.2.

Let bb be a Gaussian integer and DD\subset\mathbb{Z}. We call any infinite series of the form

(3) z=db+d1b1++d0+j=1djbj.z=d_{\ell}b^{\ell}+d_{\ell-1}b^{\ell-1}+\cdots+d_{0}+\sum_{j=1}^{\infty}d_{-j}b^{-j}.

where \ell is some integer and dkDd_{k}\in D for all kk\leq\ell a radix expansion in base (b,D)(b,D).

Theorem 1.3 (I. Katai, J. Szabo, [11], theorem 2).

Suppose nn is a positive integer and set b=n+ib=-n+i. Every complex number has a radix expansion in base (b,{0,1,,n2})(b,\{0,1,\ldots,n^{2}\}).

The radix expansions in base (n+i,{0,1,,n2})(-n+i,\{0,1,\ldots,n^{2}\}) featured in Theorem 1.3 are not always unique. In fact, complex numbers can have up to three distinct radix expansions in base (n+i,{0,1,,n2})(-n+i,\{0,1,\ldots,n^{2}\}) [6]. The rules for when two distinct radix expansions in base (n+i,{0,1,,n2})(-n+i,\{0,1,\ldots,n^{2}\}) evaluate to the same complex number are significantly more complicated and present challenges that are not present when working with real numbers. Pedersen and Shaw grappled with some of these challenges in [22].

To state the theorem proved by Pedersen and Shaw in [22], we define a function analogous to the function studied by Davis and Hu in [1]. We provide several supporting definitions that are also used in later sections of this paper.

Definition 1.4.

Fix an integer n1n\geq 1, let b:=n+ib:=-n+i and suppose D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\}. We call the attractor of the IFS given by {fd(x)=b1(x+d):dD}\{f_{d}(x)=b^{-1}(x+d):d\in D\}, the restricted digit set generated by (n,D)(n,D) and denote it by Cn,DC_{n,D}. In the special case that D={0,1,,n2}D=\{0,1,\ldots,n^{2}\}, then we call Cn,DC_{n,D} the nnth fundamental tile and denote it by TnT_{n}.

Definition 1.5.

Fix an integer n2n\geq 2 and suppose D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\}. We call the set of α\alpha\in\mathbb{C} such that Cn,D(Cn,D+α)C_{n,D}\cap(C_{n,D}+\alpha) is nonempty the fundamental set of translations generated by (n,D)(n,D) and denote it by Fn,DF_{n,D}.

Let us recall the definition of the box-counting dimension for subsets of Euclidean space.

Definition 1.6.

Let XX be a bounded subset of m\mathbb{R}^{m}. Given δ>0\delta>0, we let Nδ(X)N_{\delta}(X) denote the smallest number of sets of diameter δ\delta needed to cover XX. The upper box-counting dimension and the lower box-counting dimension of XX are

(4) dim¯BX\displaystyle\overline{\dim}_{B}X :=lim supδ0logNδ(X)logδ,\displaystyle:=\limsup_{\delta\rightarrow 0}\frac{\log N_{\delta}(X)}{-\log\delta},
(5) dim¯BX\displaystyle\underline{\dim}_{B}X :=lim infδ0logNδ(X)logδ,\displaystyle:=\liminf_{\delta\rightarrow 0}\frac{\log N_{\delta}(X)}{-\log\delta},

respectively. If these quantities are equal, then that value is the box-counting dimension of XX and is denoted by dimBX\dim_{B}X.

The box-counting dimension may not always exist. For any positive integer n1n\geq 1 and subset D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\}, Cn,DC_{n,D} is self-similar by definition and thus its box-counting dimension exists (see corollary 3.3 in [4]).

Definition 1.7.

Fix an integer n2n\geq 2 and suppose D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\}. Let C(α):=Cn,D(Cn,D+α)C(\alpha):=C_{n,D}\cap(C_{n,D}+\alpha) for α\alpha\in\mathbb{C}. We define the function

(6) Φn,D:{αFn,D:dimBC(α)exists}[0,dimBCn,D]\displaystyle\Phi_{n,D}:\{\alpha\in F_{n,D}:\dim_{B}C(\alpha)\;\;\text{exists}\}\rightarrow[0,\dim_{B}C_{n,D}]
(7) Φn,D(α)=dimBC(α).\displaystyle\Phi_{n,D}(\alpha)=\dim_{B}C(\alpha).

We can now state the theorem in [22] and our own theorem.

Theorem 1.8 (S. Pedersen, V. Shaw, [22], corollary 7.5).

Fix an integer n3n\geq 3. Suppose D{0,1,,n2/2}D\subset\{0,1,\ldots,\lfloor{n^{2}/2}\rfloor\} satisfies the condition |δδ|>n|\delta-\delta^{{}^{\prime}}|>n for all δδ\delta\neq\delta^{{}^{\prime}} in DDD-D. Then the level sets of Φn,D\Phi_{n,D} are dense in Fn,DF_{n,D}.

In this paper, we demonstrate that the condition |δδ|>n|\delta-\delta^{{}^{\prime}}|>n for all δδ\delta\neq\delta^{{}^{\prime}} in DDD-D can be significantly relaxed. In fact, it is possible to achieve the result with a lower bound that does not depend on nn. We state our theorem using the same notation as in Theorem 1.8.

Theorem 1.9.

Suppose one of the following holds

  • (i)

    nn is a positive integer greater than or equal to 22 and D{0,1,,n2/2}D\subset\{0,1,\ldots,\lfloor n^{2}/2\rfloor\} satisfies |δδ|1|\delta-\delta^{{}^{\prime}}|\neq 1 for all δ,δΔ:=DD\delta,\delta^{{}^{\prime}}\in\Delta:=D-D.

  • (ii)

    nn is a positive integer greater than or equal to 55 and D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\} satisfies |δδ|>2|\delta-\delta^{{}^{\prime}}|>2 for all δδΔ\delta\neq\delta^{{}^{\prime}}\in\Delta.

  • (iii)

    nn is one of 2,32,3 or 44 and D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\} satisfies |δδ|>3|\delta-\delta^{{}^{\prime}}|>3 for all δδΔ\delta\neq\delta^{{}^{\prime}}\in\Delta.

Then the level sets of Φn,D\Phi_{n,D} are dense in Fn,DF_{n,D}.

If any of (i), (ii), or (iii) hold, then the level sets of the maps obtained by replacing the box-counting dimension in Definition 1.7 by Hausdorff dimension or packing dimension are also dense in Fn,DF_{n,D}. This is because C(α)C(\alpha) is of Moran type. We discuss this in Section 4. We provide definitions of Hausdorff dimension and packing dimension in Section 2.

The conditions present in (ii) and (iii) are paired frequently enough that it is convenient to package them as a single definition.

Definition 1.10.

Fix a positive integer n2n\geq 2 and let DD be a subset of {0,1,,n2}\{0,1,\ldots,n^{2}\}. The set Δ:=DD\Delta:=D-D is called sparse if for all δ,δΔ\delta,\delta^{{}^{\prime}}\in\Delta either |δδ|>2|\delta-\delta^{{}^{\prime}}|>2 when n5n\geq 5 or |δδ|>3|\delta-\delta^{{}^{\prime}}|>3 when n=2,3,n=2,3, or 44.

Recall that for a fixed integer n2n\geq 2 and D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\}, we use Cn,DC_{n,D} to denote the attractor of the IFS containing all the maps fd(x)=b1(x+d)f_{d}(x)=b^{-1}(x+d) where dDd\in D and b:=n+ib:=-n+i. The conditions on the distance between elements of Δ\Delta controls the overlaps among the images fd(Cn,D),dDf_{d}(C_{n,D}),d\in D. If fd(Cn,D)fd(Cn,D)f_{d}(C_{n,D})\cap f_{d^{{}^{\prime}}}(C_{n,D}) is empty for all ddd\neq d^{{}^{\prime}}, then the IFS defined by DD is said to satisfy the strong separation condition (SSC). Once a lower bound on the differences |δδ||\delta-\delta^{{}^{\prime}}| is found to imply the SSC, we can employ a technique present in [22] to conclude that the level sets of Φn,D\Phi_{n,D} are dense. The original condition |δδ|>n|\delta-\delta^{{}^{\prime}}|>n for all δδ\delta\neq\delta^{{}^{\prime}} in Δ\Delta was achieved without leveraging the properties of radix expansions in base (n+i,{0,1,,n2})(-n+i,\{0,1,\ldots,n^{2}\}). Those properties are intimately connected to the structure of Cn,DC_{n,D}. We achieved (i) by applying the following result of Gilbert [6]. A similar statement can be made for the special case n=2n=2.

Theorem 1.11 (W. Gilbert, [6], proposition 1).

Fix an integer n3n\geq 3. Let TT be the attractor of the IFS fd(z)=(n+i)1(z+d)f_{d}(z)=(-n+i)^{-1}(z+d) where d{0,1,,n2}d\in\{0,1,\ldots,n^{2}\}. The intersection T(T+s)T\cap(T+s) is nonempty when ss is a Gaussian integer if and only if s{0,±1,±(n+i),±(n1+i)}s\in\{0,\pm 1,\pm(n+i),\pm(n-1+i)\}.

Theorem 1.11 is used in [6] to derive a graph that describes when two distinct radix expansions in base (n+i,{0,1,,n2})(-n+i,\{0,1,\ldots,n^{2}\}) evaluate to the same complex number. Suppose that for a fixed integer n2n\geq 2, (dj)j=1(d_{j})_{j=1}^{\infty} and (ej)j=1(e_{j})_{j=1}^{\infty} are distinct sequences in {0,1,,n2}\{0,1,\ldots,n^{2}\}^{\mathbb{N}} and JJ is the first index at which the sequences differ. If we have j=1djbj=j=1ejbj\sum_{j=1}^{\infty}d_{j}b^{-j}=\sum_{j=1}^{\infty}e_{j}b^{-j} where b:=n+ib:=-n+i, then |dJeJ|=1|d_{J}-e_{J}|=1 is a consequence of Theorem 1.11. Hence the separation condition of 11 present in (i) of Theorem 1.9.We take this further by determining the upper bound on |dJeJ||d_{J}-e_{J}| when dj,ej{0,±1,,±n2})d_{j},e_{j}\in\{0,\pm 1,\ldots,\pm n^{2}\}) for all jj. This investigation revealed the conditions (ii) and (iii) in Theorem 1.9. In producing this work, we also give a new proof of Theorem 1.11 that differs from Gilbert’s approach.

The results underpinning Theorem 1.9 can also be used to partially address when C(α):=Cn,D(Cn,D+α)C(\alpha):=C_{n,D}\cap(C_{n,D}+\alpha) is self-similar. This is of interest because self-similarity can somtimes be leveraged to make the computation of Hausdorff and box-counting dimension significantly easier (see Theorem 2.5). A sizeable body of work has been produced to determine when C(α)C(\alpha) is self-similar if it is a subset of the unit interval, ([2], [13], [14], [16], [21], [24], [25]). The existing results connect the self-similarity of C(α)C(\alpha) to a property called strong eventual periodicity.

Definition 1.12.

A sequence (aj)j1(a_{j})_{j\geq 1} of integers is strongly eventually periodic (SEP) if there exists a finite sequence (b)=1p(b_{\ell})_{\ell=1}^{p} and a nonnegative sequence (c)=1p(c_{\ell})_{\ell=1}^{p}, where pp is a positive integer, such that

(8) (aj)j1=(b)(b+c)=1p¯,(a_{j})_{j\geq 1}=(b_{\ell})\overline{(b_{\ell}+c_{\ell})_{\ell=1}^{p}},

where (d)=1p¯\overline{(d_{\ell})_{\ell=1}^{p}} denotes the infinite repetition of the finite sequence (d)=1p(d_{\ell})_{\ell=1}^{p}.

Suppose C3C_{3} is the middle third Cantor set (D={0,2}D=\{0,2\}) and that α\alpha is chosen such that C3(C3+α)C_{3}\cap(C_{3}+\alpha) is nonempty. It must be the case that α=j=1αj3j\alpha=\sum_{j=1}^{\infty}\alpha_{j}3^{-j} where αj{2,0,2}\alpha_{j}\in\{-2,0,2\}. It is known that C3(C3+α)C_{3}\cap(C_{3}+\alpha) is self-similar if and only if (2|αj|)j=1(2-|\alpha_{j}|)_{j=1}^{\infty} is SEP [2].

We establish analogous results for the self-similar sets Cn,DC_{n,D} implicit in Theorem 1.9.

Definition 1.13.

Fix an integer n2n\geq 2, let b:=n+ib:=-n+i, and suppose D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\}. We call the attractor of the IFS given by {fδ(x)=b1(x+δ):δDD}\{f_{\delta}(x)=b^{-1}(x+\delta):\delta\in D-D\} the extended restricted digit set generated by (n,D)(n,D) and denote it by En,DE_{n,D}. In the special case that D={0,1,,n2}D=\{0,1,\ldots,n^{2}\}, then we call En,DE_{n,D} the nnth extended tile and denote it by n\mathcal{E}_{n}.

Definition 1.14.

Let bb be a Gaussian integer. We call the function πb:\pi_{b}:\mathbb{Z}^{\mathbb{N}}\rightarrow\mathbb{C} given by π(dj)j=1=πb(dj)j=1:=j=1djbj\pi(d_{j})_{j=1}^{\infty}=\pi_{b}(d_{j})_{j=1}^{\infty}:=\sum_{j=1}^{\infty}d_{j}b^{-j} the bb-coding map.

We will drop the subscript bb when it is clear from context.

Theorem 1.15.

Fix an integer n2n\geq 2 and let b:=n+ib:=-n+i. Suppose D={0,m}D=\{0,m\} where 2mn22\leq m\leq n^{2} and that αEn,D\alpha\in E_{n,D} is chosen such that α\alpha has a unique radix expansion in base (b,{0,±m})(b,\{0,\pm m\}). Let γ:=π(γj)j=1\gamma:=\pi(\gamma_{j})_{j=1}^{\infty}, where γj=min({0,m}({0,m}+αj))\gamma_{j}=\min(\{0,m\}\cap(\{0,m\}+\alpha_{j})) for each jj.

If C(α):=Cn,D(Cn,D+α)C(\alpha):=C_{n,D}\cap(C_{n,D}+\alpha) is self-similar and is the attractor of an IFS containing the similarity f(x)=rx+(1r)γf(x)=rx+(1-r)\gamma, then (m|αj|)j=1(m-|\alpha_{j}|)_{j=1}^{\infty} is SEP. Conversely, if (m|αj|)j=1(m-|\alpha_{j}|)_{j=1}^{\infty} is SEP, then C(α)C(\alpha) is self-similar.

We can also discuss Cn,DC_{n,D} when DD contains more than two elements. We first introduce a version of strong eventual periodicity for sequences of sets.

Definition 1.16.

A sequence (Aj)j=1(A_{j})_{j=1}^{\infty} of nonempty subsets of the integers is called strongly eventually periodic (SEP) if there exist two finite sequences of sets (B)=1p(B_{\ell})_{\ell=1}^{p} and (C)=1p(C_{\ell})_{\ell=1}^{p}, where pp is a positive integer, such that

(9) (Aj)j=1=(B)(B+C)=1p¯,(A_{j})_{j=1}^{\infty}=(B_{\ell})\overline{(B_{\ell}+C_{\ell})_{\ell=1}^{p}},

where B+C={b+c:bB,cC}B+C=\{b+c:b\in B,c\in C\} and (D)=1p¯\overline{(D_{\ell})_{\ell=1}^{p}} denotes the infinite repetition of the finite sequence of sets (D)=1p(D_{\ell})_{\ell=1}^{p}.

Theorem 1.17.

Fix an integer n2n\geq 2, let b:=n+ib:=-n+i, and suppose D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\} is such that Δ:=DD\Delta:=D-D is sparse. Let α=π(αj)j=1\alpha=\pi(\alpha_{j})_{j=1}^{\infty} where αjΔ\alpha_{j}\in\Delta. The set C(α):=Cn,D(Cn,D+α)C(\alpha):=C_{n,D}\cap(C_{n,D}+\alpha) is self similar and is the attractor of an IFS containing a contraction of the form f(x)=bpx+uf(x)=b^{-p}x+u where pp is a positive integer and uu is a complex number if and only if the sequence of sets ((D(D+αj))βj)j=1((D\cap(D+\alpha_{j}))-\beta_{j})_{j=1}^{\infty} is SEP for some β=π(βj)j=1C(α)\beta=\pi(\beta_{j})_{j=1}^{\infty}\in C(\alpha).

We outline the remaining sections of this paper.

  1. (1)

    In Section 2 we set our notation and recall some definitions and results.

  2. (2)

    In Section 3 we derive the separation conditions present in Theorems 1.9 and 1.17.

  3. (3)

    In Section 4 we prove Theorem 1.9.

  4. (4)

    In Section 5 we prove Theorems 1.15 and 1.17 and discuss the Hausdorff and box-counting dimension of Cn,D(Cn,D+α)C_{n,D}\cap(C_{n,D}+\alpha).

2. Background

We recall definitions and facts from fractal geometry. There are multiple kinds of fractal dimensions used to measure the complexity of irregular geometric objects. This paper features two of the most popular, the Hausdorff dimension and the box-counting dimension, and also packing dimension. The definition of the box-couting dimension was given in Definition 1.6. We recall the definitions of Hausdorff dimension and packing dimension in Euclidean space. All three dimensions could be defined for more general metric spaces.

Definition 2.1.

Let XX be a subset of m\mathbb{R}^{m}. Given s>0s>0, the ss-dimensional Hausdorff content of XX is the quantity

(10) s(X):=infidiam(Ui)s\mathcal{H}_{\infty}^{s}(X):=\inf\sum_{i}\operatorname{diam}(U_{i})^{s}

where the infimum is taken over all countable covers {Ui}\{U_{i}\} of XX by any subsets of m\mathbb{R}^{m}. We call dimHX:=inf{s0:s(X)=0}\dim_{H}X:=\inf\{s\geq 0:\mathcal{H}_{\infty}^{s}(X)=0\} the Hausdorff dimension of XX.

Definition 2.2.

Let EmE\subset\mathbb{R}^{m}. For δ>0\delta>0, we call a countable (possibly finite) collection of disjoint balls, each with radius less than or equal to δ\delta and with their center in EE, a δ\delta-packing of EE.

Definition 2.3.

Let XX be a subset of m\mathbb{R}^{m}. Given positive numbers ss and δ\delta, and any subset EmE\subset\mathbb{R}^{m}, define the quantity

(11) 𝒫δs(E):=supi=1diam(Bi)s\mathcal{P}_{\delta}^{s}(E):=\sup\sum_{i=1}^{\infty}\operatorname{diam}(B_{i})^{s}

where the supremum is taken over all δ\delta-packings of EE. Let 𝒫0s(E):=limδ0+Pδs(E)\mathcal{P}_{0}^{s}(E):=\lim_{\delta\rightarrow 0^{+}}P_{\delta}^{s}(E). The ss-dimensional packing measure of XX is the quantity

(12) 𝒫s(X):=inf{i=1𝒫0s(Xi):Xi=1Xi}.\mathcal{P}^{s}(X):=\inf\bigg{\{}\sum_{i=1}^{\infty}\mathcal{P}_{0}^{s}(X_{i}):X\subset\cup_{i=1}^{\infty}X_{i}\bigg{\}}.

We call dimPX:=inf{s0:𝒫s(X)=0}\dim_{P}X:=\inf\{s\geq 0:\mathcal{P}^{s}(X)=0\} the packing dimension of XX.

For all bounded subsets of XmX\subset\mathbb{R}^{m}, we have

(13) dimHXdimPXdimB¯XanddimHXdimB¯XdimB¯X.\dim_{H}X\leq\dim_{P}X\leq\overline{\dim_{B}}X\;\;\text{and}\;\;\dim_{H}X\leq\underline{\dim_{B}}X\leq\overline{\dim_{B}}X.

See section 3.4 of [3] for details. For self-similar sets, such as the middle third Cantor set, all four notions of dimension agree (corollary 3.3 in [4]). In particular, if a self-similar set is the attractor of an IFS that satisfies a type of separation condition, then not only do all the dimensions agree but they are easily computable. We recall one of those separation conditions.

Definition 2.4.

Suppose AA is the attractor of an IFS given by ={fi}i=1N\mathcal{F}=\{f_{i}\}_{i=1}^{N}. We say that \mathcal{F} satisfies the strong separation condition (SSC) if the images fi1(A)f_{i_{1}}(A) and fi2(A)f_{i_{2}}(A) are disjoint for every distinct pair 1i1,i2N1\leq i_{1},i_{2}\leq N.

Theorem 2.5 (K. Falconer, [4], corollary 3.3).

Suppose AA is the attractor of the set of similarities ={fi}i=1N\mathcal{F}=\{f_{i}\}_{i=1}^{N}. For each ii, let rir_{i} be the contraction ratio of fif_{i}. If \mathcal{F} satisfies the SSC, then dimBA=dimHA=dimPA=s\dim_{B}A=\dim_{H}A=\dim_{P}A=s where ss is the unique positive solution to i=1Nris=1\sum_{i=1}^{N}r_{i}^{s}=1.

It is common to state a stronger version of this theorem (see theorem 9.3 of [3]). It replaces the SSC with a weaker notion called the open set condition (OSC). An IFS given by {fi:XX}i=1N\{f_{i}:X\rightarrow X\}_{i=1}^{N} satisfies the OSC if there exists an open set 𝒪X\mathcal{O}\subset X such that i=1Nfi(𝒪)𝒪\cup_{i=1}^{N}f_{i}(\mathcal{O})\subset\mathcal{O}. We also remark that the cited statements in [3] and [4] do not mention the packing dimension, but the first inequality in (13) implies the assertion immediately.

3. Neighbouring Tiles

In this section we derive the bounds present in Theorem 1.9 and Theorem 1.17. We begin with two definitions.

Definition 3.1.

Let YY\subset\mathbb{C}. We call any Gaussian integer ss that satisfies

(14) Y(Y+s)Y\cap(Y+s)\neq\emptyset

a neighbour of YY.

Definition 3.2.

Fix an integer n2n\geq 2 and set b:=n+ib:=-n+i. We call the attractor of the IFS given by {fd(x)=b1(x+d):d{0,1,,n2}}\{f_{d}(x)=b^{-1}(x+d):d\in\{0,1,\ldots,n^{2}\}\} the nnth fundamental tile and denote it by TnT_{n}. Similarly, we call the attractor of the IFS given by {fd(x)=b1(x+δ):d{0,±1,,±n2}}\{f_{d}(x)=b^{-1}(x+\delta):d\in\{0,\pm 1,\ldots,\pm n^{2}\}\} the nnth extended tile and denote it by n\mathcal{E}_{n}.

Our goal is to find the real neighbours of TnT_{n} and n\mathcal{E}_{n} for n2n\geq 2. To this end, we prove the following lemma.

Lemma 3.3.

Fix an integer n2n\geq 2. Suppose ss is a neighbour of TnT_{n}. Then

(15) |Re(s)nIm(s)|<2.|\operatorname{Re}(s)-n\operatorname{Im}(s)|<2.

Moreover |Re(s)nIm(s)|<3/2|\operatorname{Re}(s)-n\operatorname{Im}(s)|<3/2 for n5n\geq 5.

Proof.

Let ss be a neighbour of T=TnT=T_{n}. For convenience, we set α:=Re(s)\alpha:=\operatorname{Re}(s) and β:=Im(s)\beta:=\operatorname{Im}(s). By definition there exist sequences (dj)j=1(d_{j})_{j=1}^{\infty} and (dj)j=1(d_{j}^{{}^{\prime}})_{j=1}^{\infty} with entries in {0,1,,n2}\{0,1,\ldots,n^{2}\} such that

(16) s+π(dj)j=1=π(dj)j=1.s+\pi(d_{j})_{j=1}^{\infty}=\pi(d_{j}^{{}^{\prime}})_{j=1}^{\infty}.

Isolating for ss yields

(17) s=π(δj)j=1s=\pi(\delta_{j})_{j=1}^{\infty}

where δj{0,±1,,±n2}\delta_{j}\in\{0,\pm 1,\ldots,\pm n^{2}\} for each jj.

We wish to estimate the difference between the real part of ss and nn times its imaginary part. We explicitly compute the first few terms of ss in terms of nn. Observe that

(18) s=δ1b+δ2b2+δ3b3+δ4b4+ϵs=\frac{\delta_{1}}{b}+\frac{\delta_{2}}{b^{2}}+\frac{\delta_{3}}{b^{3}}+\frac{\delta_{4}}{b^{4}}+\epsilon

where ϵ\epsilon denotes the tail j=5δjbj\sum_{j=5}^{\infty}\delta_{j}b^{-j}.

Explicit computation yields

(19) α=nn2+1δ1+n21(n2+1)2δ2+n3+3n(n2+1)3δ3+n46n2+1(n2+1)4δ4+Re(ϵ)\alpha=\frac{-n}{n^{2}+1}\delta_{1}+\frac{n^{2}-1}{(n^{2}+1)^{2}}\delta_{2}+\frac{-n^{3}+3n}{(n^{2}+1)^{3}}\delta_{3}+\frac{n^{4}-6n^{2}+1}{(n^{2}+1)^{4}}\delta_{4}+\operatorname{Re}(\epsilon)\\

and

(20) β=1n2+1δ1+2n(n2+1)2δ2+3n2+1(n2+1)3δ3+4n34n(n2+1)4δ4+Im(ϵ).\beta=\frac{-1}{n^{2}+1}\delta_{1}+\frac{2n}{(n^{2}+1)^{2}}\delta_{2}+\frac{-3n^{2}+1}{(n^{2}+1)^{3}}\delta_{3}+\frac{4n^{3}-4n}{(n^{2}+1)^{4}}\delta_{4}+\operatorname{Im}(\epsilon).\\

Subtracting nn times (20) from (19) yields

(21) αnβ=1n2+1δ2+2n(n2+1)2δ3+3n42n2+1(n2+1)4δ4+Re(ϵ)nIm(ϵ).\alpha-n\beta=\frac{-1}{n^{2}+1}\delta_{2}+\frac{2n}{(n^{2}+1)^{2}}\delta_{3}+\frac{-3n^{4}-2n^{2}+1}{(n^{2}+1)^{4}}\delta_{4}+\operatorname{Re}(\epsilon)-n\operatorname{Im}(\epsilon).

Recall that δj\delta_{j} range from n2-n^{2} to n2n^{2}. In order to bound |αnβ||\alpha-n\beta| with an expression that is only in terms of nn, we maximize the sum of the first three terms of (21) by choosing δ2=δ4=n2\delta_{2}=\delta_{4}=-n^{2} and δ3=n2\delta_{3}=n^{2} and estimate the absolute value of the last two terms using the bound |Re(ϵ)nIm(ϵ)|(n+1)j=5n2|b|j=(n+1)(|b|+1)/|b|4|Re(\epsilon)-n\operatorname{Im}(\epsilon)|\leq(n+1)\sum_{j=5}^{\infty}n^{2}|b|^{-j}=(n+1)(|b|+1)/|b|^{4}. This results in the inequality

(22) |αnβ|n2n2+1+2n3(n2+1)2+3n6+2n4n2(n2+1)4+(n+1)(n2+1+1)(n2+1)2|\alpha-n\beta|\leq\frac{n^{2}}{n^{2}+1}+\frac{2n^{3}}{(n^{2}+1)^{2}}+\frac{3n^{6}+2n^{4}-n^{2}}{(n^{2}+1)^{4}}+\frac{(n+1)(\sqrt{n^{2}+1}+1)}{(n^{2}+1)^{2}}

Direct computation with n=3,4,5,6n=3,4,5,6 yields bounds less than 1.85,1.63,1.5,1.85,1.63,1.5, and 1.411.41. For n7n\geq 7, observe that we can respectively bound each term of (22) by the following sequences.

(23) n2n2+1\displaystyle\frac{n^{2}}{n^{2}+1} <1,\displaystyle<1,
(24) 2n3(n2+1)2\displaystyle\frac{2n^{3}}{(n^{2}+1)^{2}} <2n,\displaystyle<\frac{2}{n},
(25) 3n6+2n4n2(n2+1)4\displaystyle\frac{3n^{6}+2n^{4}-n^{2}}{(n^{2}+1)^{4}} <5n2,\displaystyle<\frac{5}{n^{2}},
(26) (n+1)(n2+1+1)(n2+1)2\displaystyle\frac{(n+1)(\sqrt{n^{2}+1}+1)}{(n^{2}+1)^{2}} <5n2.\displaystyle<\frac{5}{n^{2}}.

Consider the sum of all the sequences on the right hand side of a “<<” sign from (23) to (26). The sum is a strictly decreasing sequence and at n=7n=7 is less than 1.491.49. This completes the proof. ∎

Corollary 3.4.

Fix an integer n2n\geq 2. The set of real neighbours of n\mathcal{E}_{n} is

  • (i)

    {0,±1,±2}\{0,\pm 1,\pm 2\} when n=1n=1 or n5n\geq 5 .

  • (ii)

    {0,±1,±2,±3}\{0,\pm 1,\pm 2,\pm 3\} when n=2,3,n=2,3, or 44.

Additionally, the set of real neighbours of TnT_{n} is {0,±1}\{0,\pm 1\} for all n1n\geq 1.

Proof.

The set of neighbours of TnT_{n} when n=1,2n=1,2 and the set of neighbours of n\mathcal{E}_{n} when n=1,2,3n=1,2,3 or 44 can be explicitly computed using the neighbour finding algorithm found in [23]. We prove the remaining cases.

It follows immediately from Lemma 3.3 that the real neighbours of TnT_{n} must be in {0,±1}\{0,\pm 1\}. To see the converse, it can be verified by direct computation that

(27) 1+0.(2n1)((n1)2+1)0¯\displaystyle 1+0.(2n-1)\overline{((n-1)^{2}+1)0} =0.00((n1)2+1)¯,\displaystyle=0.0\overline{0((n-1)^{2}+1)},
(28) 1+0.00((n1)2+1)¯\displaystyle-1+0.0\overline{0((n-1)^{2}+1)} =0.(2n1)((n1)2+1)0¯,\displaystyle=0.(2n-1)\overline{((n-1)^{2}+1)0},

where the bar indicates infinite repetition of those digits in the order presented. We include the verification of (27).

Let

(29) z1:=0.((n1)2+1)0¯,\displaystyle z_{1}:=0.\overline{((n-1)^{2}+1)0},
(30) z2:=0.0((n1)2+1)¯.\displaystyle z_{2}:=0.\overline{0((n-1)^{2}+1)}.

Since the sequences of digits are periodic with period two and letting b:=n+ib:=-n+i,

(31) b2z1z1\displaystyle b^{2}z_{1}-z_{1} =((n1)2+1)b,\displaystyle=((n-1)^{2}+1)b,
(32) b2z2z2\displaystyle b^{2}z_{2}-z_{2} =(n1)2+1.\displaystyle=(n-1)^{2}+1.

From these equations it is possible to solve for z1z_{1} and z2z_{2} explicitly in terms of nn. We obtain

(33) z1\displaystyle z_{1} =((n1)2+1)(n+i)(n222ni)\displaystyle=\frac{((n-1)^{2}+1)(-n+i)}{(n^{2}-2-2ni)}
(34) z2\displaystyle z_{2} =((n1)2+1)(n222ni).\displaystyle=\frac{((n-1)^{2}+1)}{(n^{2}-2-2ni)}.

We wish to show that

(35) ((n1)2+1)(n222ni)+2n1n+i+1=((n1)2+1)(n222ni)(n+i)\frac{((n-1)^{2}+1)}{(n^{2}-2-2ni)}+\frac{2n-1}{-n+i}+1=\frac{((n-1)^{2}+1)}{(n^{2}-2-2ni)(-n+i)}

Observe that on the left hand side of (35), after bringing it under a common denominator, the numerator is

(36) ((n1)2+1)(n+i)+(2n1)(n222ni)+(n+i)(n222ni).((n-1)^{2}+1)(-n+i)+(2n-1)(n^{2}-2-2ni)+(-n+i)(n^{2}-2-2ni).

It now can be seen from the right hand side of (35) that it is sufficient to show that

(37) (2n1)(n222ni)+(n+i)(n222ni)=(1+ni)((n1)2+1).(2n-1)(n^{2}-2-2ni)+(-n+i)(n^{2}-2-2ni)=(1+n-i)((n-1)^{2}+1).

We conclude with

(38) (2n1)(n222ni)+(n+i)(n222ni)\displaystyle(2n-1)(n^{2}-2-2ni)+(-n+i)(n^{2}-2-2ni)
(39) =(n1+i)(n222ni)\displaystyle=(n-1+i)(n^{2}-2-2ni)
(40) =((n1)2+1)(n222ni)/(n1i)\displaystyle=((n-1)^{2}+1)(n^{2}-2-2ni)/(n-1-i)
(41) =((n1)2+1)(n+1i).\displaystyle=((n-1)^{2}+1)(n+1-i).

Now we consider the nnth extended tile. If pp is a neighbour of n\mathcal{E}_{n}, then p=π(pj)j=1p=\pi(p_{j})_{j=1}^{\infty} where pj{0,±1,,±(2n21),±(2n2)}p_{j}\in\{0,\pm 1,\ldots,\pm(2n^{2}-1),\pm(2n^{2})\}. It follows that the function bounding |Re(s)Im(s)||\operatorname{Re}(s)-\operatorname{Im}(s)| in (22) merely needs to be doubled in order to bound |Re(p)nIm(p)||\operatorname{Re}(p)-n\operatorname{Im}(p)|. Therefore |Re(p)nIm(p)|<3|\operatorname{Re}(p)-n\operatorname{Im}(p)|<3 and the real neighbours of n\mathcal{E}_{n} are contained in {0,±1,±2}\{0,\pm 1,\pm 2\}. To see that 22 and 2-2 are neighbours of n\mathcal{E}_{n} for n5n\geq 5, it can be verified directly that 0.0(n2)(n2)2¯=2.(4n2)(n2)2(n2)¯0.0\overline{(-n^{2})(n-2)^{2}}=2.(4n-2)\overline{(n-2)^{2}(-n^{2})}. ∎

We end this section by demonstrating a further application of Lemma 3.3. Gilbert gave a proof of the following result in [6].

Theorem 3.5 (W. Gilbert, [6], proposition 1).

A Gaussian integer ss is a neighbour of TnT_{n} if and only if

  • (i)

    s{0,±1,±(n1+i),±(n+i)}s\in\{0,\pm 1,\pm(n-1+i),\pm(n+i)\} and n3n\geq 3.

  • (ii)

    s{0,±1,±(1+i),±(2+i),±i,±(2+2i)}s\in\{0,\pm 1,\pm(1+i),\pm(2+i),\pm i,\pm(2+2i)\} and n=2n=2.

Gilbert used this result to derive the rules governing radix expansions in base (n+i,{0,1,,n2})(-n+i,\{0,1,\ldots,n^{2}\}) (see theorem 5 and theorem 8 of [6]). Our proof, by way of Lemma 3.3, uses a different approach than that of Gilbert.

We first point out the following simple observation.

Lemma 3.6.

Fix an integer n2n\geq 2. If ss is a neighbour of TnT_{n}, then bs+δbs+\delta is a neighbour of TnT_{n} for some δ{0,±1,,±n2}\delta\in\{0,\pm 1,\ldots,\pm n^{2}\}.

Proof.

Again, there exist sequences (dj)j=1(d_{j})_{j=1}^{\infty} and (dj)j=1(d_{j}^{{}^{\prime}})_{j=1}^{\infty} with entries in {0,1,,n2}\{0,1,\ldots,n^{2}\} such that

(42) s+π(dj)j=1=π(dj)j=1.s+\pi(d_{j})_{j=1}^{\infty}=\pi(d_{j}^{{}^{\prime}})_{j=1}^{\infty}.

This equation holds if and only if

(43) bs+(d1d1)+π(dj+1)j=1=π(dj+1)j=1.bs+(d_{1}-d_{1}^{{}^{\prime}})+\pi(d_{j+1})_{j=1}^{\infty}=\pi(d_{j+1}^{{}^{\prime}})_{j=1}^{\infty}.

This completes the proof. ∎

We are now in position to prove Theorem 3.5.

Proof of Theorem 3.5.

These case n=2n=2 can be computed explicitly using the neighbour finding algorithm in [23]. We proceed assuming n3n\geq 3. Suppose ss is a neighbour of TnT_{n}.

By Lemma 3.3, if ss is real, then s{0,±1}s\in\{0,\pm 1\}. That lemma also implies that ss cannot be purely imaginary. If that were the case, |nIm(s)|<2|n\operatorname{Im}(s)|<2 where n3n\geq 3. This is impossible.

We now claim that |Im(s)||\operatorname{Im}(s)| cannot be larger than 11. Let us denote Im(s)\operatorname{Im}(s) by β\beta. Lemma 3.3 implies that Re(s)Re(s) is one of nβ1n\beta-1, nβn\beta, or nβ+1n\beta+1. Let us assume β\beta is greater than or equal to 22. The magnitude of ss is therefore bounded below by nβ1n\beta-1. On the otherhand, |s|n2j=1|b|j=n2+1+1|s|\leq n^{2}\sum_{j=1}^{\infty}|b|^{-j}=\sqrt{n^{2}+1}+1. We will argue that this quantity is strictly less nβ1n\beta-1 for n3n\geq 3. Observe that for n3n\geq 3

(44) n2+1+1\displaystyle\sqrt{n^{2}+1}+1 <n+2\displaystyle<n+2
(45) 2n1\displaystyle\leq 2n-1
(46) nβ1.\displaystyle\leq n\beta-1.

The second inequality holds since n30n-3\geq 0. This shows that when β2\beta\geq 2, the number ss is not a neighbour of TnT_{n}. The case when β\beta is less than or equal to 2-2 is similar.

The only remaining cases to consider are β=1\beta=1 or 1-1. Lemma 3.3 implies that ss is one of ±(n1+i),±(n+i)\pm(n-1+i),\pm(n+i), and ±(n+1+i)\pm(n+1+i).

By Lemma 3.6, if n+1+in+1+i is a neighbour of TnT_{n}, there must exist δ{0,±1,,±n2}\delta\in\{0,\pm 1,\ldots,\pm n^{2}\} such that b(n+1+i)+δb(n+1+i)+\delta is also a neighbour of TnT_{n}. The set of neighbours of TnT_{n} is a subset of {0,±1,±(n1+i),±(n+i),±(n+1+i)}\{0,\pm 1,\pm(n-1+i),\pm(n+i),\pm(n+1+i)\}. We observe that b(n+1+i)=(n2+n+1)+ib(n+1+i)=-(n^{2}+n+1)+i. We see that adding an element of {0,±1,,±n2}\{0,\pm 1,\ldots,\pm n^{2}\} (a real number) to this expression cannot result in any of 0, 11, and 1-1. To see that not a single neighbour is obtainable, we compute δ\delta using the remaining potential neighbours of TnT_{n}.

(47) (n+i)+n2+n+1i\displaystyle(n+i)+n^{2}+n+1-i =n2+2n+1,\displaystyle=n^{2}+2n+1,
(48) (ni)+n2+n+1i\displaystyle(-n-i)+n^{2}+n+1-i =n2+12i,\displaystyle=n^{2}+1-2i,
(49) (n1+i)+n2+n+1i\displaystyle(n-1+i)+n^{2}+n+1-i =n2+2n,\displaystyle=n^{2}+2n,
(50) (n+1i)+n2+n+1i\displaystyle(-n+1-i)+n^{2}+n+1-i =n2+22i,\displaystyle=n^{2}+2-2i,
(51) (n+1+i)+n2+n+1i\displaystyle(n+1+i)+n^{2}+n+1-i =n2+2n+2,\displaystyle=n^{2}+2n+2,
(52) (n1i)+n2+n+1i\displaystyle(-n-1-i)+n^{2}+n+1-i =n22i.\displaystyle=n^{2}-2i.

All of these are either larger than n2n^{2} or are not real and therefore are not in {0,±1,,±n2}\{0,\pm 1,\ldots,\pm n^{2}\}. We conclude that n+1+in+1+i is not a neighbour of TnT_{n}. Similarly, it can be shown that n1i-n-1-i is not a neighbour of TnT_{n}.

We have shown that a neighbour of TT is an element of the set {0,±1,±(n1+i),±(n+i)}\{0,\pm 1,\pm(n-1+i),\pm(n+i)\}. To see that the converse also holds, we show that there exists tT(T+s)t\in T\cap(T+s) for each ss. It can be verified explicitly that

(53) 1+0.(2n1)((n1)2+1)0¯\displaystyle 1+0.(2n-1)\overline{((n-1)^{2}+1)0} =0.00((n1)2+1)¯,\displaystyle=0.0\overline{0((n-1)^{2}+1)},
(54) 1+0.00((n1)2+1)¯\displaystyle-1+0.0\overline{0((n-1)^{2}+1)} =0.(2n1)((n1)2+1)0¯,\displaystyle=0.(2n-1)\overline{((n-1)^{2}+1)0},
(55) (n+i)+0.n200((n1)2+1)¯\displaystyle(n+i)+0.n^{2}0\overline{0((n-1)^{2}+1)} =0.0(2n1)((n1)2+1)0¯,\displaystyle=0.0(2n-1)\overline{((n-1)^{2}+1)0},
(56) (ni)+0.0(2n1)((n1)2+1)0¯\displaystyle(-n-i)+0.0(2n-1)\overline{((n-1)^{2}+1)0} =0.n200((n1)2+1)¯,\displaystyle=0.n^{2}0\overline{0((n-1)^{2}+1)},
(57) (n1+i)+0.((n1)2+1)0¯\displaystyle(n-1+i)+0.\overline{((n-1)^{2}+1)0} =0.0((n1)2+1)¯,\displaystyle=0.\overline{0((n-1)^{2}+1)},
(58) (n+1i)+0.0((n1)2+1)¯\displaystyle(-n+1-i)+0.\overline{0((n-1)^{2}+1)} =0.((n1)2+1)0¯.\displaystyle=0.\overline{((n-1)^{2}+1)0}.

The verification can be performed in the same way as in the proof of Corollary 3.4.

4. An Application to Box-Counting Dimension

In this section we prove Theorem 1.9. Let us recall the definition of the box-counting dimension.

Definition 4.1.

Let XX be a bounded subset of m\mathbb{R}^{m}. Given δ>0\delta>0, we let Nδ(X)N_{\delta}(X) denote the smallest number of sets of diameter δ\delta needed to cover XX. The upper box-counting dimension and the lower box-counting dimension of XX are

(59) dim¯BX\displaystyle\overline{\dim}_{B}X :=lim supδ0logNδ(X)logδ,\displaystyle:=\limsup_{\delta\rightarrow 0}\frac{\log N_{\delta}(X)}{-\log\delta},
(60) dim¯BX\displaystyle\underline{\dim}_{B}X :=lim infδ0logNδ(X)logδ,\displaystyle:=\liminf_{\delta\rightarrow 0}\frac{\log N_{\delta}(X)}{-\log\delta},

respectively. If these quantities are equal, then that value is the box-counting dimension of XX and is denoted by dimBX\dim_{B}X.

It is known that we can replace the function NδN_{\delta} with the function that counts the number of δ\delta-mesh cubes that intersect XX and still capture the upper and lower box-counting dimensions (see 3.1 in [3]). This is the collection of cubes {[k1δ,(kd+1)δ]××[kdδ,(kd+1)δ]:kj}\{[k_{1}\delta,(k_{d}+1)\delta]\times\cdots\times[k_{d}\delta,(k_{d}+1)\delta]:k_{j}\in\mathbb{Z}\}. In the plane, it is a collection of squares. For our purposes, we wish to count translations of scalings of the nnth fundamental tile TnT_{n} (see Definition 3.2).

Definition 4.2.

Let AA be the attractor of an iterated function system {f1,f2,,fm}\{f_{1},f_{2},\ldots,f_{m}\} and let kk be a positive integer. A kk-tile of AA is any set of the form Aj1,j2,,jk:=(fj1fj2fjk)(A)A_{j_{1},j_{2},\ldots,j_{k}}:=(f_{j_{1}}\circ f_{j_{2}}\circ\cdots\circ f_{j_{k}})(A).

For n2n\geq 2, the kk-tiles of T=TnT=T_{n} are the sets Td1,,dk={0.d1d2dk+bkt:tT}T_{d_{1},\ldots,d_{k}}=\{0.d_{1}d_{2}\ldots d_{k}+b^{-k}t:t\in T\}, where d1,d2,,dk{0,1,2,,n2}d_{1},d_{2},\ldots,d_{k}\in\{0,1,2,\ldots,n^{2}\}. The following lemma, Lemma 4.3, allows us to trade counting boxes with counting kk-tiles in order to compute the upper and lower box-counting dimensions.

Lemma 4.3.

Fix an integer n2n\geq 2. Let FF be a nonempty subset of TnT_{n}. For a fixed integer k1k\geq 1, let Nk(F)N_{k}(F) denote the number of kk-tiles of TnT_{n} that intersect FF. Then

(61) dim¯BF\displaystyle\overline{\dim}_{B}F =lim supklogNk(F)klog|b|,\displaystyle=\limsup_{k\rightarrow\infty}\frac{\log N_{k}(F)}{k\log{|b|}},
(62) dim¯BF\displaystyle\underline{\dim}_{B}F =lim infklogNk(F)klog|b|.\displaystyle=\liminf_{k\rightarrow\infty}\frac{\log N_{k}(F)}{k\log{|b|}}.

The proof of this result can be found in [22]. Computing Nk(F)N_{k}(F) can be made easier if kk-tiles are disjoint. We provide a sufficient condition.

Lemma 4.4.

Fix an integer n2n\geq 2. Let D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\} satisfy |dd|1|d-d^{{}^{\prime}}|\neq 1 for all dDd\in D. The kk-tiles Td1,,dkT_{d_{1},\ldots,d_{k}} and Td1,,dkT_{d_{1}^{{}^{\prime}},\ldots,d_{k}^{{}^{\prime}}} of TnT_{n} are disjoint whenever djdjd_{j}\neq d_{j}^{{}^{\prime}} for some 1jk1\leq j\leq k and dj,djDd_{j},d_{j}^{{}^{\prime}}\in D for each jj.

Proof.

Suppose that (d1,d2,,dk)(d_{1},d_{2},\ldots,d_{k}) and (d1,d2,,dk)(d_{1}^{{}^{\prime}},d_{2}^{{}^{\prime}},\ldots,d_{k}^{{}^{\prime}}) are distinct tuples with dj,djDd_{j},d_{j}^{{}^{\prime}}\in D for each jj. Let JJ be the smallest index in the set {1,2,,k}\{1,2,\ldots,k\} at which the specified digits differ. Suppose that the intersection of the two kk tiles is nonempty. By definition, there exists sequences (dk+j)j1(d_{k+j})_{j\geq 1} and (dk+j)j1(d_{k+j}^{{}^{\prime}})_{j\geq 1} with dk+j,dk+j{0,1,,n2}d_{k+j},d_{k+j}^{{}^{\prime}}\in\{0,1,\ldots,n^{2}\} for each jj such that π(dj)j=1=π(dj)j=1\pi(d_{j})_{j=1}^{\infty}=\pi(d_{j}^{{}^{\prime}})_{j=1}^{\infty}. Multiplying by bJb^{J} and then subtracting d1bJ1++dJd_{1}b^{J-1}+\cdots+d_{J} on both sides yields π(dJ+j)j=1=(dJdJ)+π(dJ+j)j=1\pi(d_{J+j})_{j=1}^{\infty}=(d_{J}^{{}^{\prime}}-d_{J})+\pi(d_{J+j}^{{}^{\prime}})_{j=1}^{\infty} and thus dJdJd_{J}^{{}^{\prime}}-d_{J} is a neighbour of TnT_{n} where |dJdJ|>1|d_{J}-d_{J}^{{}^{\prime}}|>1. This contradicts Corollary 3.4. ∎

Theorem 4.5 and Theorem 4.9 are extensions of theorem 7.4 in [22]. Recall that Cn,DC_{n,D} denotes the restricted digit set generatedy by (n,D)(n,D) (see Definition 1.4).

Theorem 4.5.

Fix n2n\geq 2 and suppose D{0,1,,n2/2}D\subset\{0,1,\ldots,\lfloor n^{2}/2\rfloor\} is such that |δδ|1|\delta-\delta^{{}^{\prime}}|\neq 1 for all δ,δΔ:=DD\delta,\delta^{{}^{\prime}}\in\Delta:=D-D. If α=π(αj)j=1\alpha=\pi(\alpha_{j})_{j=1}^{\infty} such that αjΔ\alpha_{j}\in\Delta, then

(63) dim¯B(Cn,d(Cn,D+α))=lim infklogMk(α)klog|b|\underline{\dim}_{B}(C_{n,d}\cap(C_{n,D}+\alpha))=\liminf_{k\rightarrow\infty}\frac{\log{M_{k}(\alpha)}}{k\log{|b|}}

where Mk(α):=j=1k|D(D+αj)|M_{k}(\alpha):=\prod_{j=1}^{k}|D\cap(D+\alpha_{j})|.

Remark 4.6.

The result in [22], theorem 7.4, requires that |δδ|>n|\delta-\delta^{{}^{\prime}}|>n for all δ,δΔ\delta,\delta^{{}^{\prime}}\in\Delta as opposed to the separation condition of 11. We also mention that the lower box-counting dimension could be replaced with the upper box-counting dimension.

Proof.

Let C(α):=Cn,D(Cn,D+α)C(\alpha):=C_{n,D}\cap(C_{n,D}+\alpha). According to Lemma 4.3, it suffices to prove that λMk(α)Nk(C(α))ρMk(α)\lambda M_{k}(\alpha)\leq N_{k}(C(\alpha))\leq\rho M_{k}(\alpha) for contants λ,ρ\lambda,\rho. This will hold if we show that the collection of kk-tiles Td1,d2,,dkT_{d_{1},d_{2},\ldots,d_{k}}, where djD(D+αj)d_{j}\in D\cap(D+\alpha_{j}) covers C(α)C(\alpha) and each kk-tile in the cover intersects C(α)C(\alpha).

Let Td1,d2,,dkT_{d_{1},d_{2},\ldots,d_{k}} be a kk-tile with djD(D+αj)d_{j}\in D\cap(D+\alpha_{j}) for j=1,2,,kj=1,2,\ldots,k. For each jj, there exists djDd_{j}^{{}^{\prime}}\in D such that equation dj=dj+αjd_{j}=d_{j}^{{}^{\prime}}+\alpha_{j} holds. In general, αj=dj′′dj′′′\alpha_{j}=d_{j}^{{}^{\prime\prime}}-d_{j}^{{}^{\prime\prime\prime}} with dj′′,dj′′′Dd_{j}^{{}^{\prime\prime}},d_{j}^{{}^{\prime\prime\prime}}\in D for each jj. Consider the number z:=π(zj)j=1z:=\pi(z_{j})_{j=1}^{\infty}\ldots such that zj=djz_{j}=d_{j} for all 1jk1\leq j\leq k and zj=dj′′z_{j}=d_{j}^{{}^{\prime\prime}} for all j>kj>k. Immediately we see that zz is an element of Cn,DC_{n,D}. Since the number given by 0.d1d2dkdk+1′′′dk+2′′′0.d_{1}^{{}^{\prime}}d_{2}^{{}^{\prime}}\ldots d_{k}^{{}^{\prime}}d_{k+1}^{{}^{\prime\prime\prime}}d_{k+2}^{{}^{\prime\prime\prime}}\ldots is also an element of Cn,DC_{n,D}, it follows that zCn,D+αz\in C_{n,D}+\alpha. Therefore Td1,d2,,dkT_{d_{1},d_{2},\ldots,d_{k}} intersects C(α)C(\alpha). We conclude that Mk(α)Nk(C(α))M_{k}(\alpha)\leq N_{k}(C(\alpha)).

Now we argue that for any positive integer kk the C(α)C(\alpha) is covered by the kk-tiles which specifiy digits in D(D+αj)D\cap(D+\alpha_{j}) for each j=1,2,,kj=1,2,\ldots,k. Let zC(α)z\in C(\alpha). This means there exists sequences (dj)j=1(d_{j})_{j=1}^{\infty} and (dj)j=1(d_{j}^{{}^{\prime}})_{j=1}^{\infty} such that

(64) π(dj)j=1=π(dj+αj)j=1\pi(d_{j})_{j=1}^{\infty}=\pi(d_{j}^{{}^{\prime}}+\alpha_{j})_{j=1}^{\infty}

Recall that αj=dj′′dj′′′\alpha_{j}=d_{j}^{{}^{\prime\prime}}-d_{j}^{{}^{\prime\prime\prime}} for each jj. Adding π(dj′′′)j=1\pi(d_{j}^{{}^{\prime\prime\prime}})_{j=1}^{\infty} to both sides of (64) yields

(65) π(dj+dj′′′)j=1=π(dj+dj′′)j=1.\pi(d_{j}+d_{j}^{{}^{\prime\prime\prime}})_{j=1}^{\infty}=\pi(d_{j}^{{}^{\prime}}+d_{j}^{{}^{\prime\prime}})_{j=1}^{\infty}.

Since dn2/2d\leq n^{2}/2 for all dDd\in D, and dj,dj,dj′′d_{j},d_{j}^{{}^{\prime}},d_{j}^{{}^{\prime\prime}}, and dj′′′d_{j}^{{}^{\prime\prime\prime}} are all elements of DD for all jj, their pairwise sums are in {0,1,,n2}\{0,1,\ldots,n^{2}\}. Furthermore, any separation condition on the elements of Δ\Delta holds if and only the same condition holds for elements of D+DD+D. This is because (a+b)(c+d)=(ac)(db)(a+b)-(c+d)=(a-c)-(d-b) for any collection of integers a,b,c,da,b,c,d. It follows from Lemma 4.4 that dj+dj′′′=dj+dj′′d_{j}+d_{j}^{{}^{\prime\prime\prime}}=d_{j}^{{}^{\prime}}+d_{j}^{{}^{\prime\prime}}. In particular, dj=dj+xjd_{j}=d_{j}^{{}^{\prime}}+x_{j} and we conclude that zTd1,d2,,dkz\in T_{d_{1},d_{2},\ldots,d_{k}} for any kk where djD(D+αj)d_{j}\in D\cap(D+\alpha_{j}). It follows from Theorem 3.5 that each of these kk-tiles intersects at most 99 kk-tiles of TT. This yields Nk(C(α))9Mk(α)N_{k}(C(\alpha))\leq 9M_{k}(\alpha). ∎

The following example is an application of Theorem 4.5 to a case that is not covered by theorem 7.4 in [22].

Example 4.7.

Let b=3+ib=-3+i. The subsets of {0,1,,9}\{0,1,\ldots,9\} for which d9/2d\leq 9/2 are subsets of {0,1,2,3,4}\{0,1,2,3,4\}. The constraint that every pair of elements a,aΔa,a^{{}^{\prime}}\in\Delta satisfies |aa|1|a-a^{{}^{\prime}}|\neq 1 yields the following subsets of {0,1,2,3,4}\{0,1,2,3,4\} that are not singletons: {0,2}\{0,2\}, {0,3}\{0,3\}, {0,4}\{0,4\}, {1,3}\{1,3\}, {1,4}\{1,4\}, {2,4}\{2,4\}, and {0,2,4}\{0,2,4\}. If DD is a singleton, then so is CC. The box-counting dimension of Cn,DC_{n,D}, and consequently C(α)C(\alpha) for any α\alpha, is zero in that case.

Suppose we choose D={0,4}D=\{0,4\}. Therefore Δ\Delta is equal to {4,0,4}\{-4,0,4\}. The intersection of C3,{0,4}C_{3,\{0,4\}} and its translation by α=28+24i19+26i=0.404¯\alpha=\frac{-28+24i}{-19+26i}=0.\overline{-404} is nonempty. We compute its box-counting dimension. Since |D(D4)|=|D(D+4)|=1|D\cap(D-4)|=|D\cap(D+4)|=1 and |D|=2|D|=2, it follows that

(66) Mk(α)={2k/3ifk0mod3,2(k1)/3ifk1mod3,2(k+1)/3ifk2mod3.M_{k}(\alpha)=\begin{cases}2^{k/3}&\;\text{if}\;k\equiv 0\mod{3},\\ 2^{(k-1)/3}&\;\text{if}\;k\equiv 1\mod{3},\\ 2^{(k+1)/3}&\;\text{if}\;k\equiv 2\mod{3}.\end{cases}

Therefore 2(k1)/3Mk(α)2(k+1)/32^{(k-1)/3}\leq M_{k}(\alpha)\leq 2^{(k+1)/3} for all kk. In particular,

(67) (k1)log23klog10logMk(α)klog10(k+1)log23klog10.\frac{(k-1)\log{2}}{3k\log{10}}\leq\frac{\log{M_{k}(\alpha)}}{k\log{10}}\leq\frac{(k+1)\log{2}}{3k\log{10}}.

By Theorem 4.5, we conclude that dimB(C(α))=log23log10\dim_{B}(C(\alpha))=\frac{\log{2}}{3\log{10}}.

It is possible to remove the bound of n2/2n^{2}/2 when the elements of DDD-D satisfy a larger separation condition.

Fix a positive integer n2n\geq 2 and let DD be a subset of {0,1,,n2}\{0,1,\ldots,n^{2}\}. Recall that the set Δ:=DD\Delta:=D-D is called sparse if for all δ,δΔ\delta,\delta^{{}^{\prime}}\in\Delta either |δδ|>2|\delta-\delta^{{}^{\prime}}|>2 when n5n\geq 5 or |δδ|>3|\delta-\delta^{{}^{\prime}}|>3 when n=2,3n=2,3 or 44.

The following lemma is analogous to Lemma 4.4, but addresses the nnth extended tile n\mathcal{E}_{n} (see Definition 3.2) rather than the nnth fundamental tile TnT_{n}.

Lemma 4.8.

Fix an integer n2n\geq 2 and suppose D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\} is chosen such that Δ:=DD\Delta:=D-D is sparse. The kk-tiles δ1,,δk\mathcal{E}_{\delta_{1},\ldots,\delta_{k}} and δ1,,δk\mathcal{E}_{\delta_{1}^{{}^{\prime}},\ldots,\delta_{k}^{{}^{\prime}}} are disjoint whenever δjδj\delta_{j}\neq\delta_{j}^{{}^{\prime}} for some index 1jk1\leq j\leq k where δj,δjΔ\delta_{j},\delta_{j}^{{}^{\prime}}\in\Delta for each jj.

Proof.

Suppose n5n\geq 5 and |δδ|>2|\delta-\delta^{{}^{\prime}}|>2 for all distinct δ,δΔ\delta,\delta^{{}^{\prime}}\in\Delta. Suppose δ1,,δkδ1,,δk\mathcal{E}_{\delta_{1},\ldots,\delta_{k}}\cap\mathcal{E}_{\delta_{1}^{{}^{\prime}},\ldots,\delta_{k}^{{}^{\prime}}} is not empty. We can deduce in the same way as in the proof of Lemma 4.4 that an integer with magnitude greater than 22 is a neighbour of n\mathcal{E}_{n}. This contradicts Corollarly 3.4. Similarly, if n=2,3,n=2,3, or 44 and |δδ|>3|\delta-\delta^{{}^{\prime}}|>3 and we assume that the intersection is nonempty, we also obtain a contradiction with Corollary 3.4. ∎

Theorem 4.9.

Fix and integer n2n\geq 2 and suppose D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\} is chosen such that Δ:=DD\Delta:=D-D is sparse. If α=π(αj)j=1\alpha=\pi(\alpha_{j})_{j=1}^{\infty} such that αjΔ\alpha_{j}\in\Delta, then

(68) dim¯B(Cn,D(Cn,D+α))=lim infklogMk(α)klog|b|\underline{\dim}_{B}(C_{n,D}\cap(C_{n,D}+\alpha))=\liminf_{k\rightarrow\infty}\frac{\log{M_{k}(\alpha)}}{k\log{|b|}}

where Mk(α):=j=1k|D(D+αj)|M_{k}(\alpha):=\prod_{j=1}^{k}|D\cap(D+\alpha_{j})|.

This extends the application of the formula to sets Cn,DC_{n,D} that are not covered by Theorem 4.5. For example, for those sets defined using n=3n=3 and D={0,4,8}D=\{0,4,8\}. Theorem 4.5 does apply to some cases that Theorem 4.9 does not. For example, n=3n=3 and D={0,3}D=\{0,3\}.

Proof.

Let C(α):=Cn,D(Cn,D+α)C(\alpha):=C_{n,D}\cap(C_{n,D}+\alpha). The same argument used in the proof of Theorem 4.5 can be used to show that Mk(α)Nk(C(α))M_{k}(\alpha)\leq N_{k}(C(\alpha)) and so we omit it. Let us skip to showing that every zC(α)z\in C(\alpha) is contained in a kk-tile for any positive integer kk whose defining digits are in D(D+αj)D\cap(D+\alpha_{j}) for each j=1,2,,kj=1,2,\ldots,k.

For zCn,Dz\in C_{n,D}, there exists sequences (dj)j1(d_{j})_{j\geq 1} and (dj)j1(d_{j}^{{}^{\prime}})_{j\geq 1} such that

(69) z=π(dj)j=1=π(dj+αj)j=1.z=\pi(d_{j})_{j=1}^{\infty}=\pi(d_{j}^{{}^{\prime}}+\alpha_{j})_{j=1}^{\infty}.

Substracting π(d1)j=1\pi(d_{1}^{{}^{\prime}})_{j=1}^{\infty} from the equation and obtain

(70) π(djdj)j=1=π(αj)j=1.\pi(d_{j}-d_{j}^{{}^{\prime}})_{j=1}^{\infty}=\pi(\alpha_{j})_{j=1}^{\infty}.

By Lemma 4.8, it follows that dj=dj+αjd_{j}=d_{j}^{{}^{\prime}}+\alpha_{j}. It immediately follows that Td1,d2,,dkT_{d_{1},d_{2},\ldots,d_{k}} is kk tile of the desired form. As in the proof of Theorem 4.5 this implies Nk(C(α))9Mk(α)N_{k}(C(\alpha))\leq 9M_{k}(\alpha). ∎

The conclusions present in Theorem 1.9 now follow as corollaries of Theorem 4.5 and Theorem 4.9. We include the proof from [22] for completeness. For a fixed integer n2n\geq 2 and a subset D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\}, set C(α):=Cn,D(Cn,D+α)C(\alpha):=C_{n,D}\cap(C_{n,D}+\alpha). Recall that Fn,DF_{n,D} denotes the fundamental set of translations {α:C(α)}\{\alpha\in\mathbb{C}:C(\alpha)\neq\emptyset\}. Recall the function Φn,D:{αFn,D:dimBC(α)exists}[0,dimBCn,D]\Phi_{n,D}:\{\alpha\in F_{n,D}:\dim_{B}C(\alpha)\;\;\text{exists}\}\rightarrow[0,\dim_{B}C_{n,D}] given by αdimBC(α).\alpha\mapsto\dim_{B}C(\alpha).

Corollary 4.10.

Fix an integer n2n\geq 2. Suppose either that D{0,1,,n2/2}D\subset\{0,1,\ldots,\lfloor n^{2}/2\rfloor\} satisfies |δδ|1|\delta-\delta^{{}^{\prime}}|\neq 1 for all δ,δΔ:=DD\delta,\delta^{{}^{\prime}}\in\Delta:=D-D or that D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\} is chosen such that Δ\Delta is sparse. The level sets of Φn,D\Phi_{n,D} are dense in Fn,DF_{n,D}.

Proof.

Let αFn,D\alpha\in F_{n,D} be given. We construct β\beta in the domain of Φn,D\Phi_{n,D} such that Φn,D(β)=λdimBCn,D\Phi_{n,D}(\beta)=\lambda\dim_{B}C_{n,D} where λ[0,1]\lambda\in[0,1]. The α=π(αj)j=1\alpha=\pi(\alpha_{j})_{j=1}^{\infty} where αjΔ\alpha_{j}\in\Delta. For any radius r>0r>0, there exists an index mm at which any complex number of the form β=0.α1α2αmβm+1βm+2\beta=0.\alpha_{1}\alpha_{2}\ldots\alpha_{m}\beta_{m+1}\beta_{m+2}\ldots with βjΔ\beta_{j}\in\Delta is within distance rr of α\alpha. We now describe how to choose the βj\beta_{j} such that β\beta satisfies the desired properties.

Suppose 0<λ<10<\lambda<1. There exists a sequence of integers hjh_{j} such that hjjλ<hj+1h_{j}\leq j\lambda<h_{j}+1. Since λ<1\lambda<1 we see that (j+1)λ<jλ+1<(hj+1)+1(j+1)\lambda<j\lambda+1<(h_{j}+1)+1. It follows that either hj+1=hjh_{j+1}=h_{j} or hj+1=hj+1h_{j+1}=h_{j}+1. Let dmaxd_{\text{max}} and dmind_{\text{min}} denote the maximum and minimum of DD respectively. For all j>mj>m, let

(71) βj={dmaxdminifhj=hj1,0ifhj=hj1+1.\beta_{j}=\begin{cases}d_{\text{max}}-d_{\text{min}}&\;\text{if}\;h_{j}=h_{j-1},\\ 0&\;\text{if}\;h_{j}=h_{j-1}+1.\end{cases}

It follows that |D(D+βj)||D\cap(D+\beta_{j})| is equal to either 11 or |D||D| for j>mj>m. The key observation here is that in either case this is |D|hjhj1|D|^{h_{j}-h_{j-1}}.

We can compute the lower box-counting dimension of C(β):=Cn,D(Cn,D+β)C(\beta):=C_{n,D}\cap(C_{n,D}+\beta) using either Theorem 4.5 or Theorem 4.9. Directly,

(72) dim¯B(C(β))\displaystyle\underline{\dim}_{B}(C(\beta)) =lim infklogMk(β)klog|b|\displaystyle=\liminf_{k\rightarrow\infty}\frac{\log{M_{k}(\beta)}}{k\log{|b|}}
(73) =lim infklogj=1m|D(D+αj)|klog|b|+lim infklogj=m+1k|D(D+βj)|klog|b|\displaystyle=\liminf_{k\rightarrow\infty}\frac{\log{\prod_{j=1}^{m}|D\cap(D+\alpha_{j})|}}{k\log{|b|}}+\liminf_{k\rightarrow\infty}\frac{\log{\prod_{j=m+1}^{k}|D\cap(D+\beta_{j})|}}{k\log{|b|}}
(74) =0+lim infklogj=m+1k|D|hjhj1klog|b|\displaystyle=0+\liminf_{k\rightarrow\infty}\frac{\log{\prod_{j=m+1}^{k}|D|^{h_{j}-h_{j-1}}}}{k\log{|b|}}
(75) =lim infk(hkhm)log|D|klog|b|\displaystyle=\liminf_{k\rightarrow\infty}\frac{(h_{k}-h_{m})\log{|D|}}{k\log{|b|}}
(76) =αdimBC\displaystyle=\alpha\dim_{B}C

We can see now that the limit infimum is in fact a limit. If λ=0\lambda=0, then choose βj=dmaxdmin\beta_{j}=d_{\text{max}}-d_{\text{min}} for all j>mj>m. If λ=1\lambda=1, then choose βj=0\beta_{j}=0 for all j>mj>m. ∎

It immediately follows that the function Φn,D\Phi_{n,D} is discontinuous everywhere on its domain.

We end this section by establishing versions of Corollary 4.10 for Hausdorff dimension and packing dimension. See Definition 2.1 and Definition 2.3 for details.

Definition 4.11.

Fix an integer n2n\geq 2 and suppose D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\}. Let C(α):=Cn,D(Cn,D+α)C(\alpha):=C_{n,D}\cap(C_{n,D}+\alpha) for α\alpha\in\mathbb{C}. We define the functions

(77) Ψn,D:Fn,D[0,dimHCn,D],Θn,D:Fn,D[0,dimPCn,D],Ψn,D(α)=dimHC(α),Θn,D(α)=dimPC(α).\begin{split}&\Psi_{n,D}:F_{n,D}\rightarrow[0,\dim_{H}C_{n,D}],\\ &\Theta_{n,D}:F_{n,D}\rightarrow[0,\dim_{P}C_{n,D}],\end{split}\quad\begin{split}&\Psi_{n,D}(\alpha)=\dim_{H}C(\alpha),\\ &\Theta_{n,D}(\alpha)=\dim_{P}C(\alpha).\end{split}

Under the conditions of Corollary 4.10, we can show that the level sets of these functions are also dense in Fn,DF_{n,D}.

Definition 4.12.

Let (nk)k=1(n_{k})_{k=1}^{\infty} be a sequence of positive integers, and let (Rk)k=1(R_{k})_{k=1}^{\infty} be a sequence of vectors (ck,1,ck,2,,ck,nk)(c_{k,1},c_{k,2},\ldots,c_{k,n_{k}}) such that 0<ck,j<10<c_{k,j}<1 for all k1k\geq 1 and 1jnk1\leq j\leq n_{k}. Let JmJ\subset\mathbb{R}^{m} be a compact set with nonempty interior. Let \mathcal{F} denote a set of subsets of m\mathbb{R}^{m} indexed by W:={}(k=1Wk)W:=\{\emptyset\}\cup(\cup_{k=1}^{\infty}W_{k}) where Wk:={(j1,j2,,jk):1jn,1k}W_{k}:=\{(j_{1},j_{2},\ldots,j_{k}):1\leq j_{\ell}\leq n_{\ell},1\leq\ell\leq k\}. Given two words σ\sigma and τ\tau, we denote their concatenation by στ\sigma*\tau.

The set \mathcal{F} is said to satisfy the Moran structure given by ((nk)k=1,(Rk)k=1,J)((n_{k})_{k=1}^{\infty},(R_{k})_{k=1}^{\infty},J) if it satisfies the following four conditions:

  • (i)

    J=JJ_{\emptyset}=J.

  • (ii)

    For any σW\sigma\in W, there exists a similarity Sσ:mmS_{\sigma}:\mathbb{R}^{m}\rightarrow\mathbb{R}^{m} such that Sσ(J)=JσS_{\sigma}(J)=J_{\sigma}.

  • (iii)

    For any k0k\geq 0 and σWk1\sigma\in W_{k-1}, the interiors of JσjJ_{\sigma*j} and JσJ_{\sigma*\ell} are disjoint for all 1j,nk1\leq j,\ell\leq n_{k} such that jj\neq\ell.

  • (iv)

    For any k0k\geq 0 and σWk1\sigma\in W_{k-1}, 1jnk1\leq j\leq n_{k}, diam(Jσj)diam(Jσ)=ck,j\frac{\operatorname{diam}(J_{\sigma*j})}{\operatorname{diam}(J_{\sigma})}=c_{k,j}.

For \mathcal{F} satisfying the Moran structure, set Ek=σWkJσE_{k}=\cup_{\sigma\in W_{k}}J_{\sigma} and E=k=1EkE=\cap_{k=1}^{\infty}E_{k}. We call EE the Moran set associated with the collection \mathcal{F}.

It is known that the Hausdorff dimension and packing dimension of a Moran set can be expressed in terms of a sequence derived from the “contraction coefficients” ck,jc_{k,j}.

Theorem 4.13 (Hua S., Rao H., Wen Z., Wu J., [7], theorem 1.1).

Suppose EE is the Moran set associated with a collection \mathcal{F} satisfying the Moran structure given by ((nk)k=1,(Rk)k=1,J)((n_{k})_{k=1}^{\infty},(R_{k})_{k=1}^{\infty},J). For each kk, let sks_{k} be the solution to the equation σWkcσsk=1\sum_{\sigma\in W_{k}}c_{\sigma}^{s_{k}}=1 where cσ:=Π=1kc,jc_{\sigma}:=\Pi_{\ell=1}^{k}c_{\ell,j_{\ell}} for σ=(j1,j2,,jk)\sigma=(j_{1},j_{2},\ldots,j_{k}). If infi,jci,j>0\inf_{i,j}c_{i,j}>0, then

(78) dimHE\displaystyle\dim_{H}E =lim infksk\displaystyle=\liminf_{k\rightarrow\infty}s_{k}
(79) dimPE\displaystyle\dim_{P}E =lim supksk.\displaystyle=\limsup_{k\rightarrow\infty}s_{k}.

This is useful because the sets of the form Cn,D(Cn,D+α)C_{n,D}\cap(C_{n,D}+\alpha) are Moran sets under conditions on n,D,n,D, and α\alpha. This allows us to state the following result.

Theorem 4.14.

Fix an integer n2n\geq 2. Suppose either that D{0,1,,n2/2}D\subset\{0,1,\ldots,\lfloor n^{2}/2\rfloor\} satisfies |δδ|1|\delta-\delta^{{}^{\prime}}|\neq 1 for all δ,δΔ:=DD\delta,\delta^{{}^{\prime}}\in\Delta:=D-D or that D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\} is chosen such that Δ\Delta is sparse. The level sets of Ψn,D\Psi_{n,D} and Θn,D\Theta_{n,D} are respectively dense in Fn,DF_{n,D}.

Proof.

Let b:=n+ib:=-n+i. We begin by arguing that the set C(α):=Cn,D(Cn,D+α)C(\alpha):=C_{n,D}\cap(C_{n,D}+\alpha) is a Moran set whenever αFn,D\alpha\in F_{n,D}. It follows from the definition of Fn,DF_{n,D} that α=π(αj)j=1\alpha=\pi(\alpha_{j})_{j=1}^{\infty} where αjΔ\alpha_{j}\in\Delta for each jj. Choose (nk)k=1=(|D(D+αk)|)k=1(n_{k})_{k=1}^{\infty}=(|D\cap(D+\alpha_{k})|)_{k=1}^{\infty}, (Rk)k=1(R_{k})_{k=1}^{\infty} such that the entries of every vector are |b|1|b|^{-1}, and J=Cn,DJ=C_{n,D}. Let k\mathcal{F}_{k} denote the set of cylinders of the form π({d1}××{dk}×D)\pi(\{d_{1}\}\times\cdots\times\{d_{k}\}\times D^{\mathbb{N}}) where djD(D+αj)d_{j}\in D\cap(D+\alpha_{j}) for j=1,2,,kj=1,2,\ldots,k. The set C(α)C(\alpha) is then the Moran set associated with the collection k=1k\cup_{k=1}^{\infty}\mathcal{F}_{k}. Additionally, since the entries of the vector RkR_{k} are the constant |b|1|b|^{-1} for every kk, the infimum across all entries of vectors in the sequence (Rk)k=1(R_{k})_{k=1}^{\infty} is greater than zero.

By Theorem 4.13, we have dimHC(α)=lim infksk\dim_{H}C(\alpha)=\liminf_{k\rightarrow\infty}s_{k} where sks_{k} is the solution to σWkcσsk=1\sum_{\sigma\in W_{k}}c_{\sigma}^{s_{k}}=1. This is (Πj=1k|D(D+αj)|)|b|ksk=1(\Pi_{j=1}^{k}|D\cap(D+\alpha_{j})|)|b|^{-ks_{k}}=1. Solving this equation for sks_{k} reveals that sk=Mk(α)s_{k}=M_{k}(\alpha). Therefore dimHC(α)=dimB¯C(α)\dim_{H}C(\alpha)=\underline{\dim_{B}}C(\alpha). Similarly, dimPC(α)=dimB¯C(α)\dim_{P}C(\alpha)=\overline{\dim_{B}}C(\alpha). Recall that s:=dimBC(α)=dimHC(α)=dimPC(α)s:=\dim_{B}C(\alpha)=\dim_{H}C(\alpha)=\dim_{P}C(\alpha) since Cn,DC_{n,D} is self-similar (corollary 3.3 of [4]). We have that for all λ[0,s]\lambda\in[0,s], Φn,D1(λ)\Phi_{n,D}^{-1}(\lambda) is a subset of both Ψn,D1(λ)\Psi_{n,D}^{-1}(\lambda) and Θn,D1(λ)\Theta_{n,D}^{-1}(\lambda). The conclusion now holds by Corollary 4.10. ∎

5. Applications to Self-Similarity

In this section we prove Theorem 1.15 and Theorem 1.17. Let us recall the notion of strong eventual periodicity for sequences of sets from the introduction.

Definition 5.1.

A sequence (aj)j1(a_{j})_{j\geq 1} of integers is strongly eventually periodic (SEP) if there exists a finite sequence (b)=1p(b_{\ell})_{\ell=1}^{p} and a nonnegative sequence (c)=1p(c_{\ell})_{\ell=1}^{p}, where pp is a positive integer, such that

(80) (aj)j1=(b)(b+c)=1p¯,(a_{j})_{j\geq 1}=(b_{\ell})\overline{(b_{\ell}+c_{\ell})_{\ell=1}^{p}},

where (d)=1p¯\overline{(d_{\ell})_{\ell=1}^{p}} denotes the infinite repetition of the finite sequence (d)=1p(d_{\ell})_{\ell=1}^{p}.

The following is a convenient sufficient condition for the SEP property.

Lemma 5.2.

Let (aj)j=1(a_{j})_{j=1}^{\infty} be a bounded sequence of nonnegative integers. If there exists a positive integer qq such that ajaj+qa_{j}\leq a_{j+q} for all j1j\geq 1, then (aj)j1(a_{j})_{j\geq 1} is SEP.

Proof.

Since aja_{j} is bounded for all jj, there exists a positive integer qq such that aj+kpa_{j+kp} is constant for all kqk\geq q and j=1,2,,qj=1,2,\ldots,q. It follows that there exists a positive integer mm such that (aj)j=1=a1a2amqa1+mqa2+mqaq+mq¯(a_{j})_{j=1}^{\infty}=a_{1}a_{2}\ldots a_{mq}\overline{a_{1+mq}a_{2+mq}\ldots a_{q+mq}}.

For each j=1,2,,qj=1,2,\ldots,q, there exist non-negative integers vj+(m)qv_{j+(m-\ell)q} where =1,2,m\ell=1,2,\ldots m such that

(81) aj+mq\displaystyle a_{j+mq} =aj+(m1)q+vj+(m1)q\displaystyle=a_{j+(m-1)q}+v_{j+(m-1)q}
(82) =aj+(m2)q+vj+(m1)q+vj+(m2)q\displaystyle=a_{j+(m-2)q}+v_{j+(m-1)q}+v_{j+(m-2)q}
(83) \displaystyle\;\;\vdots
(84) =aj+=1mvj+(m)q.\displaystyle=a_{j}+\sum_{\ell=1}^{m}v_{j+(m-\ell)q}.

By choosing uj+qk==1mkvj+(m)qu_{j+qk}=\sum_{\ell=1}^{m-k}v_{j+(m-\ell)q} for j=1,2,,qj=1,2,\ldots,q and k=0,1,,m1k=0,1,\ldots,m-1, we obtain (aj)j1=(a1a2am)(a1+u1)(a2+u2)(amq+umq)¯(a_{j})_{j\geq 1}=(a_{1}a_{2}\ldots a_{m})\overline{(a_{1}+u_{1})(a_{2}+u_{2})\ldots(a_{mq}+u_{mq})}. ∎

The following fact about self-similar sets is also useful.

Lemma 5.3.

Let aa be an element of m\mathbb{R}^{m}. If SmS\subset\mathbb{R}^{m} is self-similar and is the attractor of the IFS given by {fi(x)=rix+ui}i=1N\{f_{i}(x)=r_{i}x+u_{i}\}_{i=1}^{N} where rir_{i} is a linear transformation from m\mathbb{R}^{m} to m\mathbb{R}^{m} and uimu_{i}\in\mathbb{R}^{m}, then the translation S+a:={x+a:xS}S+a:=\{x+a:x\in S\} is also a self-similar set and is the attractor of the IFS {gi(x)=fi(x)+(1ri)a}i=1n\{g_{i}(x)=f_{i}(x)+(1-r_{i})a\}_{i=1}^{n}.

Proof.

Since SS is a nonempty compact set, so is S+aS+a. Since attractors are unique we need only observe that i=1Ngi(S+a)=i=1N(fi(S)+a)=(i=1Nfi(S))+a=S+a\cup_{i=1}^{N}g_{i}(S+a)=\cup_{i=1}^{N}(f_{i}(S)+a)=(\cup_{i=1}^{N}f_{i}(S))+a=S+a. ∎

Fix an integer n2n\geq 2 and suppose D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\}. Given α=π(αj)j=1\alpha=\pi(\alpha_{j})_{j=1}^{\infty} with αjDD\alpha_{j}\in D-D, we wish to relate the self-similarity of C(α):=Cn,D(Cn,D+α)C(\alpha):=C_{n,D}\cap(C_{n,D}+\alpha) to the condition that (m|αj|)j=1(m-|\alpha_{j}|)_{j=1}^{\infty} is SEP. The first step is to express C(α)C(\alpha) in terms of the sequence of sets (D(D+αj))j=1(D\cap(D+\alpha_{j}))_{j=1}^{\infty}. Recall that En,DE_{n,D} denotes the extended restricted digit set generated by (n,D)(n,D) (see Definition 1.13).

Lemma 5.4.

Fix an integer n2n\geq 2 and suppose D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\}. If αEn,D\alpha\in E_{n,D} has a unique radix expansion in base (b,DD)(b,D-D), then Cn,D(Cn,D+α)=π(Πj=1D(D+αj))C_{n,D}\cap(C_{n,D}+\alpha)=\pi(\Pi_{j=1}^{\infty}D\cap(D+\alpha_{j})).

Proof.

Assume that α=π(αj)j=1\alpha=\pi(\alpha_{j})_{j=1}^{\infty} where αjΔ:=DD\alpha_{j}\in\Delta:=D-D for all jj and (αj)j=1(\alpha_{j})_{j=1}^{\infty} is unique. Let C(α)C(\alpha) denote Cn,D(Cn,D+α)C_{n,D}\cap(C_{n,D}+\alpha). If zC(α)z\in C(\alpha), then zCn,Dz\in C_{n,D} and zCn,D+αz\in C_{n,D}+\alpha. On one hand, z=π(zj)j=1z=\pi(z_{j})_{j=1}^{\infty} with zjDz_{j}\in D for all jj. On the other, there exists yCn,Dy\in C_{n,D} such that z=y+αz=y+\alpha. Similarly, y=π(yj)j=1y=\pi(y_{j})_{j=1}^{\infty} where yjDy_{j}\in D for all jj. We conclude that α=π(zjyj)j=1\alpha=\pi(z_{j}-y_{j})_{j=1}^{\infty} where zjyjΔz_{j}-y_{j}\in\Delta for all jj. Since the radix expansion in base (b,Δ)(b,\Delta) of α\alpha is unique, we conclude that zjyj=αjz_{j}-y_{j}=\alpha_{j} and, in particular, zj=yj+αjz_{j}=y_{j}+\alpha_{j} for all jj. This means that zjD(D+αj)z_{j}\in D\cap(D+\alpha_{j}) for all jj. We leave the inclusion π(D(D+αj))C(α)\pi(D\cap(D+\alpha_{j}))\subset C(\alpha) for the reader. ∎

Lemma 5.4 will be used in the proofs of Theorem 1.15 and Theorem 1.17. In the case of Theorem 1.15, we transform the set Cn,D(Cn,D+α)C_{n,D}\cap(C_{n,D}+\alpha) once more.

Definition 5.5.

Fix an integer n2n\geq 2, D={0,m}D=\{0,m\}, 2mn22\leq m\leq n^{2}, and choose αEn,D\alpha\in E_{n,D} such that α\alpha has a unique radix expansion π(αj)j=1\pi(\alpha_{j})_{j=1}^{\infty} in base (b,DD)(b,D-D). We call γ:=π(γj)j=1\gamma:=\pi(\gamma_{j})_{j=1}^{\infty}, where γj:=min(D(D+αj))\gamma_{j}:=\min(D\cap(D+\alpha_{j})) for each jj, the minimal element of Cn,D(Cn,D+α)C_{n,D}\cap(C_{n,D}+\alpha).

Lemma 5.6.

Fix an integer n2n\geq 2 and suppose D={0,m}D=\{0,m\} where 2mn22\leq m\leq n^{2}. If αEn,D\alpha\in E_{n,D} has a unique radix expansion π(αj)j=1\pi(\alpha_{j})_{j=1}^{\infty} in base (b,DD)(b,D-D) and γ\gamma is the minimal element of C(α):=Cn,D(Cn,D+α)C(\alpha):=C_{n,D}\cap(C_{n,D}+\alpha). Then C(α)γ={π(zj)j=1:zjD,zjm|αj|}C(\alpha)-\gamma=\{\pi(z_{j})_{j=1}^{\infty}:z_{j}\in D,z_{j}\leq m-|\alpha_{j}|\} and C(α)γC(\alpha)-\gamma is a subset of Cn,DC_{n,D}.

Proof.

By Lemma 5.4, we can equate C(α)C(\alpha) and π(Πj=1D(D+αj))\pi(\Pi_{j=1}^{\infty}D\cap(D+\alpha_{j})). It follows that C(α)γC(\alpha)-\gamma is equal to π(Πj=1(D(D+αj))γj)\pi(\Pi_{j=1}^{\infty}(D\cap(D+\alpha_{j}))-\gamma_{j}).

It is sufficient to show that for any j1j\geq 1, the condition zjm|αj|z_{j}\leq m-|\alpha_{j}| and zjDz_{j}\in D, holds if and only if zjz_{j} is an element of (D(D+αj))γj(D\cap(D+\alpha_{j}))-\gamma_{j}. There are three possible values for αj\alpha_{j} for each jj. If αj=m\alpha_{j}=m, (D(D+αj))γj={0}(D\cap(D+\alpha_{j}))-\gamma_{j}=\{0\} and m|αj|=0m-|\alpha_{j}|=0 and it is now clear that the bi-implication holds. If αj=m\alpha_{j}=-m, we obtain the same equations. When αj=0\alpha_{j}=0, (D(D+αj))γj={0,m}(D\cap(D+\alpha_{j}))-\gamma_{j}=\{0,m\} and m|αj|=mm-|\alpha_{j}|=m. Since {0,m}{zj:zjm}\{0,m\}\cap\{z_{j}:z_{j}\leq m\} is equal to {0,m}\{0,m\}, the bi-implication holds for this case too.

Lastly, from these calculations we see that (D(D+αj))γj(D\cap(D+\alpha_{j}))-\gamma_{j} is a subset of {0,m}=D\{0,m\}=D for all jj, no matter the value . ∎

We state an extended version of Theorem 1.15.

Theorem 5.7.

Fix an integer n2n\geq 2 and let b:=n+ib:=-n+i. Suppose D={0,m}D=\{0,m\} where 2mn22\leq m\leq n^{2} and that αEn,D\alpha\in E_{n,D} is chosen such that α\alpha has a unique radix expansion in base (b,{0,±m})(b,\{0,\pm m\}). Let γ\gamma be the minimal element of C(α):=Cn,D(Cn,D+α)C(\alpha):=C_{n,D}\cap(C_{n,D}+\alpha).

If C(α)C(\alpha) is self-similar and is the attractor of an IFS containing the similarity f(x)=rx+(1r)γf(x)=rx+(1-r)\gamma, then (m|αj|)j=1(m-|\alpha_{j}|)_{j=1}^{\infty} is SEP.

Conversely, if (m|αj|)j=1(m-|\alpha_{j}|)_{j=1}^{\infty} is SEP and so by definition can be written as (a)=1p(a+u)=1p¯(a_{\ell})_{\ell=1}^{p}\overline{(a_{\ell}+u_{\ell})_{\ell=1}^{p}}, then C(α)C(\alpha) is self-similar and is the attractor of the IFS containing all maps of the form

f(x)=bp(x+=1p(ybp+zb)γ)+γf(x)=b^{-p}(x+\sum_{\ell=1}^{p}(y_{\ell}b^{p-\ell}+z_{\ell}b^{-\ell})-\gamma)+\gamma

where for each \ell, y,z{0,m}y_{\ell},z_{\ell}\in\{0,m\} such that yay_{\ell}\leq a_{\ell} and zuz_{\ell}\leq u_{\ell}.

We follow the proof strategy for theorem 1.2 in [16].

Proof.

Assume that (m|αj|)j=1(m-|\alpha_{j}|)_{j=1}^{\infty} is an SEP sequence of integers. By definition there exist integers a1,a2,,apa_{1},a_{2},\ldots,a_{p} and u1,u2,,upu_{1},u_{2},\ldots,u_{p} such that (m|αj|)j1=a1ap(a+u)=1p¯(m-|\alpha_{j}|)_{j\geq 1}=a_{1}\ldots a_{p}\overline{(a_{\ell}+u_{\ell})_{\ell=1}^{p}}.

By Lemma 5.6, C(α,γ):=C(α)γC(\alpha,\gamma):=C(\alpha)-\gamma is equal to {π(zj)j=1:zjD,zjm|αj|}\{\pi(z_{j})_{j=1}^{\infty}:z_{j}\in D,z_{j}\leq m-|\alpha_{j}|\}.

Suppose zz is an element of C(α,γ)C(\alpha,\gamma). Therefore z=j=1zjbjz=\sum_{j=1}^{\infty}z_{j}b^{-j} with zj(m|αj|)z_{j}\leq(m-|\alpha_{j}|), zj{0,m}z_{j}\in\{0,m\} for each jj. Let us organize the expansion as

(85) z=ell=1pxb+k=1=1pxkp+b(kp+)z=\sum_{ell=1}^{p}x_{\ell}b^{-\ell}+\sum_{k=1}^{\infty}\sum_{\ell=1}^{p}x_{kp+\ell}b^{-(kp+\ell)}

where xax_{\ell}\leq a_{\ell} and xkp+a+ux_{kp+\ell}\leq a_{\ell}+u_{\ell} for =1,2,,p\ell=1,2,\ldots,p and integers k1k\geq 1. It follows that xkp+x_{kp+\ell} can be decomposed into a sum ykp++zkp+y_{kp+\ell}+z_{kp+\ell} where ykp+,zkp+{0,m}y_{kp+\ell},z_{kp+\ell}\in\{0,m\}. Let us relabel xx_{\ell} as yy_{\ell} for =1,2,,p\ell=1,2,\ldots,p. After making this substitution we can rearrange the terms to obtain

(86) z=k=1=1p(y(k1)p+bp+zkp+b)bkp.z=\sum_{k=1}^{\infty}\sum_{\ell=1}^{p}(y_{(k-1)p+\ell}b^{p-\ell}+z_{kp+\ell}b^{-\ell})b^{-kp}.

We now see that zz is an element of the attractor of the IFS {h(x)=bp(x+=1p(ybp+zb)):ya,zu\{h(x)=b^{-p}(x+\sum_{\ell=1}^{p}(y_{\ell}b^{p-\ell}+z_{\ell}b^{-\ell})):y_{\ell}\leq a_{\ell},z_{\ell}\leq u_{\ell}, y,z{0,m}y_{\ell},z_{\ell}\in\{0,m\}. We leave the other inclusion to the reader. By Lemma 5.3, C(α)C(\alpha) is self-similar because C(α,β)C(\alpha,\beta) is self-similar.

Now let us assume C(α)C(\alpha) is self-similar and is generated by an IFS containing the map f1(x)=r1x+(1r1)γf_{1}(x)=r_{1}x+(1-r_{1})\gamma. It follows from Lemma 5.3 that C(α,γ)C(\alpha,\gamma) is self similar and is generated by an IFS containing the map g1(x)=r1xg_{1}(x)=r_{1}x. Observe that 0¯\overline{0} is trivially SEP. Suppose at least one of the entries of (m|αj|)j1(m-|\alpha_{j}|)_{j\geq 1} is non-zero.

For the sake of simple notation, let C(α,γ):=C(α)γC(\alpha,\gamma):=C(\alpha)-\gamma. It follows from Lemma 5.6 that C(α,γ)C(\alpha,\gamma) contains mbqmb^{-q} for some positive integer qq. Therefore mbqr1=g1(mbq)mb^{-q}r_{1}=g_{1}(mb^{-q}) is an element of C(α,γ)C(\alpha,\gamma) and, in particular, can be expressed as π(mr1,j)j=1\pi(mr_{1,j})_{j=1}^{\infty} where r1,j{0,1}r_{1,j}\in\{0,1\}. Isolating for r1r_{1} yields

(87) r1=j=1r1,jbj+q.r_{1}=\sum_{j=1}^{\infty}r_{1,j}b^{-j+q}.

For every s1s\geq 1, we have that

(88) τ\displaystyle\tau :=g1((m|αs|)bs)\displaystyle:=g_{1}((m-|\alpha_{s}|)b^{-s})
(89) =(m|αs|)r1,1bq1s++(m|αs|)r1,qs+j=qs+1(m|αs|)r1,jb(j+s)\displaystyle=(m-|\alpha_{s}|)r_{1,1}b^{q-1-s}+\cdots+(m-|\alpha_{s}|)r_{1,q-s}+\sum_{j=q-s+1}^{\infty}(m-|\alpha_{s}|)r_{1,j}b^{-(j+s)}

is an element of C(α,γ)C(\alpha,\gamma). By Lemma 5.6, it is also an element of CC. Therefore τ=π(dj)j=1\tau=\pi(d_{j})_{j=1}^{\infty} where dj{0,m}d_{j}\in\{0,m\}. We now argue that the expansion in (89) is π(dj)j=1\pi(d_{j})_{j=1}^{\infty}. If s>q1s>q-1, the desired result immediately follows from Lemma 4.4. Suppose sq1s\leq q-1. The number τ/bq1s\tau/b^{q-1-s} is equal to j=1djbj(q1s)\sum_{j=1}^{\infty}d_{j}b^{-j-(q-1-s)} and is also an element of CC. It follows from Lemma 4.4 that r1,1=r1,2==r1,qs=0r_{1,1}=r_{1,2}=\cdots=r_{1,q-s}=0 and (m|αs|)r1,qs+j=dj(m-|\alpha_{s}|)r_{1,q-s+j}=d_{j} for all j1j\geq 1. We obtain the desired result by multiplying back by bq1sb^{q-1-s}.

Observe that r10r_{1}\neq 0 implies that r1,t=1r_{1,t}=1 for some t1t\geq 1. In particular, since |r1|<1|r_{1}|<1, it must be that we can choose t>qt>q. Otherwise, r1r_{1} is a nonzero Gaussian integer and thus has magnitude greater than one. Fix such a tt. It follows from the discussion above that m|αs|=dsq+tm-|\alpha_{s}|=d_{s-q+t} for all s1s\geq 1. Since τ\tau is an element of C(α,γ)C(\alpha,\gamma), it follows from Lemma 5.6 that dsq+tm|αs+(tq)|d_{s-q+t}\leq m-|\alpha_{s+(t-q)}| for all s1s\geq 1. Therefore m|αs|m|αs+p|m-|\alpha_{s}|\leq m-|\alpha_{s+p}| for all s1s\geq 1 where p:=tqp:=t-q is a positive integer. We conclude that the sequence (m|αj|)j=1(m-|\alpha_{j}|)_{j=1}^{\infty} is SEP by Lemma 5.2. ∎

Recall that for a fixed integer n2n\geq 2 and a set D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\}, the set Δ:=DD\Delta:=D-D is called sparse if for all δδΔ\delta\neq\delta^{{}^{\prime}}\in\Delta either |δδ|>2|\delta-\delta^{{}^{\prime}}|>2 when n5n\geq 5 or |δδ|>3|\delta-\delta^{{}^{\prime}}|>3 when n=2,3n=2,3 or 44. In the statement of Theorem 5.7, if m4m\geq 4, then Δ:=DD\Delta:=D-D would be sparse and it would follow from Lemma 4.8 that a radix expansion in base (b,Δ)(b,\Delta) of any αEn,D\alpha\in E_{n,D} is unique. The condition that Δ\Delta be sparse is stronger than the assumption that α\alpha is chosen to have a unique radix expansion. This stronger assumption does let us treat sets of digits DD that contain more than two elements. To state that the theorem, we recall the strong eventual periodicity of sequences of sets.

Definition 5.8.

A sequence (Aj)j=1(A_{j})_{j=1}^{\infty} of nonempty subsets of the integers is called strongly eventually periodic (SEP) if there exist two finite sequences of sets (B)=1p(B_{\ell})_{\ell=1}^{p} and (C)=1p(C_{\ell})_{\ell=1}^{p}, where pp is a positive integer, such that

(90) (Aj)j=1=(B)(B+C)=1p¯,(A_{j})_{j=1}^{\infty}=(B_{\ell})\overline{(B_{\ell}+C_{\ell})_{\ell=1}^{p}},

where B+C={b+c:bB,cC}B+C=\{b+c:b\in B,c\in C\} and (D)=1p¯\overline{(D_{\ell})_{\ell=1}^{p}} denotes the infinite repetition of the finite sequence of sets (D)=1p(D_{\ell})_{\ell=1}^{p}.

Remark 5.9.

There is a connection between the SEP property for sequences of sets and the SEP property of sequences of integers. If the sequence (m|αj|)j=1(m-|\alpha_{j}|)_{j=1}^{\infty} is SEP, then so is (1|αj|/m)j=1(1-|\alpha_{j}|/m)_{j=1}^{\infty}. For each jj, 1|αj|/m=|D(D+αj)|11-|\alpha_{j}|/m=|D\cap(D+\alpha_{j})|-1. It can be shown that if (|Dj|1)j=1(|D_{j}|-1)_{j=1}^{\infty} is SEP and that each DjD_{j} is an arithmetic progression with a common step size for all jj, then (Djγj)j=1(D_{j}-\gamma_{j})_{j=1}^{\infty} is SEP where γj:=minDj\gamma_{j}:=\min D_{j}. In the context of Theorem 5.7, it follows that (D(D+αj))j=1(D\cap(D+\alpha_{j}))_{j=1}^{\infty} is an SEP sequence of sets.

The following is a convenient sufficient condition for the SEP property that is analogous to lemma 5.2.

Lemma 5.10.

Let (Aj)j=1(A_{j})_{j=1}^{\infty} be a sequence of subsets of \mathbb{Z} such that there exists qq such that AjAj+qA_{j}\subset A_{j+q} and a bound, for all jj, on the cardinality of AjA_{j}. If there exists a sequence of subsets (Uj)j1(U_{j})_{j\geq 1} of \mathbb{Z} such that Aj+Uj=Aj+qA_{j}+U_{j}=A_{j+q}, then (Aj)j=1(A_{j})_{j=1}^{\infty} is SEP.

Proof.

The uniform bound on the cardinality of AjA_{j} for all jj together with the assumption AjAj+qA_{j}\subset A_{j+q} implies that the existence of a postive integer pp, such that Aj+q=Aj+q(+k)A_{j+q\ell}=A_{j+q(\ell+k)} for all k0k\geq 0 and j=1,2,,qj=1,2,\ldots,q. It follows that for j=1,2,,qj=1,2,\ldots,q,

(91) Aj+qp\displaystyle A_{j+qp} =Aj+q(p1)+Uj+q(p1)\displaystyle=A_{j+q(p-1)}+U_{j+q(p-1)}
(92) =Aj+q(p2)+Uj+q(p1)+Uj+q(p2)\displaystyle=A_{j+q(p-2)}+U_{j+q(p-1)}+U_{j+q(p-2)}
(93) \displaystyle\;\;\vdots
(94) =Aj+=1pUj+q(p).\displaystyle=A_{j}+\sum_{\ell=1}^{p}U_{j+q(p-\ell)}.

By choosing Vj+qk==1pkUj+q(p)V_{j+qk}=\sum_{\ell=1}^{p-k}U_{j+q(p-\ell)} for j=1,2,,qj=1,2,\ldots,q and k=0,1,,p1k=0,1,\ldots,p-1, we obtain (Aj)j1=(A1A2Aqp)(A1+V1)(A2+V2)(Aqp+Vqp)¯(A_{j})_{j\geq 1}=(A_{1}A_{2}\ldots A_{qp})\overline{(A_{1}+V_{1})(A_{2}+V_{2})\ldots(A_{qp}+V_{qp})}. ∎

Theorem 5.11.

Fix an integer n2n\geq 2 and suppose D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\} is such that Δ:=DD\Delta:=D-D is sparse. Let α=π(αj)j=1\alpha=\pi(\alpha_{j})_{j=1}^{\infty} where αjΔ\alpha_{j}\in\Delta. The set C(α):=Cn,D(Cn,D+α)C(\alpha):=C_{n,D}\cap(C_{n,D}+\alpha) is self similar and is the attractor of an IFS containing a contraction of the form f(x)=bpx+uf(x)=b^{-p}x+u where pp is a positive integer and uu is a complex number if and only if the sequence of sets ((D(D+αj))βj)j=1((D\cap(D+\alpha_{j}))-\beta_{j})_{j=1}^{\infty} is SEP for some β=π(βj)j=1C(α)\beta=\pi(\beta_{j})_{j=1}^{\infty}\in C(\alpha).

Moreover, since ((D(D+αj))βj)j=1((D\cap(D+\alpha_{j}))-\beta_{j})_{j=1}^{\infty} is SEP and by definition can be written as (A)=1p(A+U)=1p¯(A_{\ell})_{\ell=1}^{p}\overline{(A_{\ell}+U_{\ell})_{\ell=1}^{p}}, the set C(α)C(\alpha) is the attractor of the IFS containing all maps of the form

f(x)=bp(x+=1p(abp+ub)β)+βf(x)=b^{-p}(x+\sum_{\ell=1}^{p}(a_{\ell}b^{p-\ell}+u_{\ell}b^{-\ell})-\beta)+\beta

where aAa_{\ell}\in A_{\ell} and uUu_{\ell}\in U_{\ell} for each \ell.

We follow the proof strategy for theorem 1.2 in [21].

Proof.

Suppose β=j=1βjbjC(α)\beta=\sum_{j=1}^{\infty}\beta_{j}b^{-j}\in C(\alpha) is such that (Dj)j=1:=((D(D+αj)βj)j=1(D_{j})_{j=1}^{\infty}:=((D\cap(D+\alpha_{j})-\beta_{j})_{j=1}^{\infty} is an SEP sequence of sets. By definition there exist sets A1,A2,,ApA_{1},A_{2},\ldots,A_{p} and U1,U2,,UpU_{1},U_{2},\ldots,U_{p} such that (Dj)j1=A1Ap(A+U)=1p¯(D_{j})_{j\geq 1}=A_{1}\ldots A_{p}\overline{(A_{\ell}+U_{\ell})_{\ell=1}^{p}}.

Since Δ\Delta is sparse it follows from Lemma 4.8 that α\alpha has a unique radix expansion in base (b,Δ)(b,\Delta). Therefore, by Lemma 5.4, we have C(α)=π(Πj=1D(D+αj))C(\alpha)=\pi(\Pi_{j=1}^{\infty}D\cap(D+\alpha_{j})). It follows that C(α,β):=C(α)βC(\alpha,\beta):=C(\alpha)-\beta is equal to π(Πj=1(D(D+αj))βj)\pi(\Pi_{j=1}^{\infty}(D\cap(D+\alpha_{j}))-\beta_{j}).

Suppose zz is an element of C(α,β)C(\alpha,\beta). Therefore z=j=1zjbjz=\sum_{j=1}^{\infty}z_{j}b^{-j} with zjAjz_{j}\in A_{j}. By assumption, we can write

(95) z=j=1pa0,jbj+k=1j=1p(ak,j+uk,j)b(kp+j)z=\sum_{j=1}^{p}a_{0,j}b^{-j}+\sum_{k=1}^{\infty}\sum_{j=1}^{p}(a_{k,j}+u_{k,j})b^{-(kp+j)}

where ak,jAja_{k,j}\in A_{j} and uk,jUju_{k,j}\in U_{j}. We can rearrange the terms to obtain

(96) z=k=1j=1p(ak,jbpj+uk+1,jbj)b(k+1)p.z=\sum_{k=1}^{\infty}\sum_{j=1}^{p}(a_{k,j}b^{p-j}+u_{k+1,j}b^{-j})b^{-(k+1)p}.

We now see that zz is an element of the attractor of the IFS {h(x)=bp(x+=1p(abp+ub)):aA,uU}\{h(x)=b^{-p}(x+\sum_{\ell=1}^{p}(a_{\ell}b^{p-\ell}+u_{\ell}b^{-\ell})):a_{\ell}\in A_{\ell},u_{\ell}\in U_{\ell}\}. We leave the other inclusion to the reader. By Lemma 5.3, C(α)C(\alpha) is self-similar because C(α,β)C(\alpha,\beta) is self-similar.

Conversely, assume that C(α)C(\alpha) is generated by the IFS of the form {fi(x)=bpx+vi}i=1N\{f_{i}(x)=b^{-p}x+v_{i}\}_{i=1}^{N}. Let β=v11bp\beta=\frac{v_{1}}{1-b^{-p}}. By Lemma 5.3, C(α,β)C(\alpha,\beta) is generated by the IFS {gi(x)=bpx+ui}i=1N\{g_{i}(x)=b^{-p}x+u_{i}\}_{i=1}^{N} where ui=viv1u_{i}=v_{i}-v_{1}. Therefore g1(x)=bpxg_{1}(x)=b^{-p}x. It follows that C(α,β)C(\alpha,\beta) contains the origin. Therefore β\beta is an element of C(α)C(\alpha) and has the expansion j=1βjbj\sum_{j=1}\beta_{j}b^{-j} where βjD(D+αj)\beta_{j}\in D\cap(D+\alpha_{j}). The presence of the origin also means gi(0)=uig_{i}(0)=u_{i} is an element of C(α,β)C(\alpha,\beta) for i=1,2,,Ni=1,2,\ldots,N. It follows that each uiu_{i} can be expanded into j=1ui,jbj\sum_{j=1}^{\infty}u_{i,j}b^{-j} where ui,jDj:=(D(D+αj))βju_{i,j}\in D_{j}:=(D\cap(D+\alpha_{j}))-\beta_{j}.

Define Uj:={ui,j+p:i=1,2,,N}U_{j}:=\{u_{i,j+p}:i=1,2,\ldots,N\}. We now argue that Dj+Uj=Dj+pD_{j}+U_{j}=D_{j+p} for all j1j\geq 1.

Let dDk+Ukd\in D_{k}+U_{k}. There exists zkDkz_{k}\in D_{k} and ui,kUku_{i,k}\in U_{k}, for some ii, such that d=zk+ui,kd=z_{k}+u_{i,k}. Choose zC(α,β)z\in C(\alpha,\beta) such that its kkth digit is zkz_{k}. Then gi(z)=j=1pui,jbj+j=1(zj+ui,j+p)b(p+j)g_{i}(z)=\sum_{j=1}^{p}u_{i,j}b^{-j}+\sum_{j=1}^{\infty}(z_{j}+u_{i,j+p})b^{-(p+j)} is an element of C(α,β)C(\alpha,\beta). Therefore it also has an expansion j=1djbj\sum_{j=1}^{\infty}d_{j}b^{-j} where djDjd_{j}\in D_{j} for each jj. It follows that

(97) j=1zjb(p+j)=j=1(djui,j)bj.\sum_{j=1}^{\infty}z_{j}b^{-(p+j)}=\sum_{j=1}^{\infty}(d_{j}-u_{i,j})b^{-j}.

We deduce that zk=dk+pui,k+pz_{k}=d_{k+p}-u_{i,k+p} by applying Lemma 4.8. Therefore d=dk+pDk+pd=d_{k+p}\in D_{k+p}. Observe now that if Dk+UkDk+pD_{k}+U_{k}\subsetneq D_{k+p}, then

(98) i=1Ngi(C(α,β))\displaystyle\cup_{i=1}^{N}g_{i}(C(\alpha,\beta)) π(D1××Dk+p1×(Dk+Uk)×Πj=1Dk+p+j)\displaystyle\subset\pi(D_{1}\times\cdots\times D_{k+p-1}\times(D_{k}+U_{k})\times\Pi_{j=1}^{\infty}D_{k+p+j})
(99) π(Πj=1Dj)=C(α,β).\displaystyle\subsetneq\pi(\Pi_{j=1}^{\infty}D_{j})=C(\alpha,\beta).

This is a contradiction. Therefore Dj+Uj=Dj+pD_{j}+U_{j}=D_{j+p} for all j1j\geq 1.

Since g1g_{1} is among the contractions generating C(α,β)C(\alpha,\beta), it follows that DjDj+pD_{j}\subset D_{j+p} for all j1j\geq 1. We also recall that Dj{n2,n2+1,,n21,n2}D_{j}\subset\{-n^{2},-n^{2}+1,\ldots,n^{2}-1,n^{2}\} for all j1j\geq 1. By Lemma 5.10, it follows that (Dj)j1(D_{j})_{j\geq 1} is SEP. ∎

Remark 5.12.

The assumption that bpb^{-p} is the linear factor of one of the contractions, while sufficient, may be unnecessary.

Let us now recall the significance of self-similarity by recalling Theorem 2.5. A finite collection of similarities {fi}\{f_{i}\} satisfies the strong separation condition (see Definition 2.4), then the attractor of the IFS has box-counting dimension, Hausdorff dimension, and packing dimension equal to the unique ss that satisfies i=1Nris=1\sum_{i=1}^{N}r_{i}^{s}=1 where each rir_{i} is the contraction factor of the similarity fif_{i}. We can use this fact from fractal geometry to find the fractal dimension of Cn,D(Cn,D+α)C_{n,D}\cap(C_{n,D}+\alpha) for a suitable pair n2n\geq 2 and D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\}, and choice of α\alpha. We present two results, one aligned with Theorem 5.7 and another with Theorem 5.11.

Corollary 5.13.

Fix an integer n2n\geq 2 and let b:=n+ib:=-n+i. Suppose D={0,m}D=\{0,m\} where 2mn22\leq m\leq n^{2} and that αEn,D\alpha\in E_{n,D} is chosen such that α\alpha has a unique radix expansion in base (b,{0,±m})(b,\{0,\pm m\}). Let the finite collections of integers {a}=1p\{a_{\ell}\}_{\ell=1}^{p} and {u}=1p\{u_{\ell}\}_{\ell=1}^{p} be such that (m|αj|)j=1=(a)=1p(a+u)=1p¯(m-|\alpha_{j}|)_{j=1}^{\infty}=(a_{\ell})_{\ell=1}^{p}\overline{(a_{\ell}+u_{\ell})_{\ell=1}^{p}}. Then the following equation holds.

(100) dimBC(α)=dimHC(α)=dimPC(α)=log2=1p(a+u)mplog|b|\dim_{B}C(\alpha)=\dim_{H}C(\alpha)=\dim_{P}C(\alpha)=\frac{\log{2}\sum_{\ell=1}^{p}(a_{\ell}+u_{\ell})}{mp\log{|b|}}

where C(α):=Cn,D(Cn,D+α)C(\alpha):=C_{n,D}\cap(C_{n,D}+\alpha).

Proof.

Let γ\gamma denote the minimal element of C(α)C(\alpha). By Theorem 5.7, C(α)C(\alpha) is self-similar and in particular, C(α,γ)C(\alpha,\gamma) is the attractor of the collection of similarities of the form f(x)=bp(x+=1p(ybp+zb))f(x)=b^{-p}(x+\sum_{\ell=1}^{p}(y_{\ell}b^{p-\ell}+z_{\ell}b^{-\ell})) where y,u{0,m}y,u_{\ell}\in\{0,m\} such that yay_{\ell}\leq a_{\ell} and zuz_{\ell}\leq u_{\ell} for each \ell.

Suppose hh and gg are functions of that form and suppose there exist x1x_{1}, x2C(α,γ)x_{2}\in C(\alpha,\gamma) such that h(x1)=g(x2)h(x_{1})=g(x_{2}). Let us denote parameters of hh and gg by y(h),z(h)y_{\ell}^{(h)},z_{\ell}^{(h)} and y(g),z(g)y_{\ell}^{(g)},z_{\ell}^{(g)} respectively. By Lemma 5.6, xk=π(xj(k))j=1x_{k}=\pi(x_{j}^{(k)})_{j=1}^{\infty} for k=1,2k=1,2 with xj(k){0,m}x_{j}^{(k)}\in\{0,m\} such that xj(k)m|αj|x_{j}^{(k)}\leq m-|\alpha_{j}| for each jj. It follows that

(101) h(x1)\displaystyle h(x_{1}) =0.by1(h)yp(h)(z1(h)+x1(1))(zp(h)+xp(1))xp+1(1)xp+2(1)\displaystyle=0._{b}y_{1}^{(h)}\ldots y_{p}^{(h)}(z_{1}^{(h)}+x_{1}^{(1)})\ldots(z_{p}^{(h)}+x_{p}^{(1)})x_{p+1}^{(1)}x_{p+2}^{(1)}\ldots
(102) g(x2)\displaystyle g(x_{2}) =0.by1(g)yp(g)(z1(g)+x1(2))(zp(g)+xp(2))xp+1(2)xp+2(2)\displaystyle=0._{b}y_{1}^{(g)}\ldots y_{p}^{(g)}(z_{1}^{(g)}+x_{1}^{(2)})\ldots(z_{p}^{(g)}+x_{p}^{(2)})x_{p+1}^{(2)}x_{p+2}^{(2)}\ldots

where we recall that for k=1,2k=1,2, x(k)ax_{\ell}^{(k)}\leq a_{\ell} for =1,2,,p\ell=1,2,\ldots,p and x(k)a+ux_{\ell}^{(k)}\leq a_{\ell}+u_{\ell} for >p\ell>p. It follows that both (101) and (102) are radix expansions in base (b,D)(b,D). Since m2m\geq 2, it follows from Lemma 4.4 that y(h)=y(g)y_{\ell}^{(h)}=y_{\ell}^{(g)} and z(h)+x(1)=z(g)+x(2)z_{\ell}^{(h)}+x_{\ell}^{(1)}=z_{\ell}^{(g)}+x_{\ell}^{(2)} for each =1,2,,p\ell=1,2,\ldots,p. Suppose for some =1,2,,p\ell=1,2,\ldots,p, we have z(h)z(g)z_{\ell}^{(h)}\neq z_{\ell}^{(g)}. Without loss of generality, suppose z(h)=mz_{\ell}^{(h)}=m. It follows that x(2)=mx_{\ell}^{(2)}=m. Therefore u=a=mu_{\ell}=a_{\ell}=m. This is contradiction because a+u=m|α+p|a_{\ell}+u_{\ell}=m-|\alpha_{\ell+p}|, which can never be 2m2m. We conclude that z(h)=z(g)z_{\ell}^{(h)}=z_{\ell}^{(g)}. We conclude that h=gh=g. If hgh\neq g, then h(C(α,γ))h(C(\alpha,\gamma)) and g(C(α,γ))g(C(\alpha,\gamma)) are disjoint.

By Theorem 2.5, the box-counting, Hausdorff, and packing dimensions of C(α,β)C(\alpha,\beta), and thus C(α)C(\alpha) are both equal to the value ss satisfying Π=1p2(a+u)/m=|b|sp\Pi_{\ell=1}^{p}2^{(a_{\ell}+u_{\ell})/m}=|b|^{sp}. ∎

Corollary 5.14.

Fix an integer n2n\geq 2 and suppose D{0,1,,n2}D\subset\{0,1,\ldots,n^{2}\} is such that Δ:=DD\Delta:=D-D is sparse. Let α=π(αj)j=1\alpha=\pi(\alpha_{j})_{j=1}^{\infty} where αjΔ\alpha_{j}\in\Delta.

Let the finite collections of sets {A}=1p\{A_{\ell}\}_{\ell=1}^{p} and {U}=1p\{U_{\ell}\}_{\ell=1}^{p} be such that ((D(D+αj)βj)j=1=(A)=1p(A+U)=1p¯((D\cap(D+\alpha_{j})-\beta_{j})_{j=1}^{\infty}=(A_{\ell})_{\ell=1}^{p}\overline{(A_{\ell}+U_{\ell})_{\ell=1}^{p}} for some sequence of βjD(D+αj)\beta_{j}\in D\cap(D+\alpha_{j}). If |A+U|=|A||U||A_{\ell}+U_{\ell}|=|A_{\ell}||U_{\ell}| for each \ell, then

(103) dimBC(α)=dimHC(α)=dimPC(α)==1p(log|A||B|)plog|b|\dim_{B}C(\alpha)=\dim_{H}C(\alpha)=\dim_{P}C(\alpha)=\frac{\sum_{\ell=1}^{p}(\log{|A_{\ell}||B_{\ell}|})}{p\log{|b|}}

where C(α):=Cn,D(Cn,D+α)C(\alpha):=C_{n,D}\cap(C_{n,D}+\alpha).

We know that the sets AA_{\ell} and UU_{\ell} exist by the definition of SEP. We remark that the condition |A+U|=|A||U||A_{\ell}+U_{\ell}|=|A_{\ell}||U_{\ell}| is equivalent to the condition that every element of A+UA_{\ell}+U_{\ell} has a unique decomposition of the form a+ua_{\ell}+u_{\ell} where aAa_{\ell}\in A_{\ell} and uUu_{\ell}\in U_{\ell}.

Proof.

By Theorem 5.11, C(α)C(\alpha) is self-similar and in particular, C(α,β):=C(α)βC(\alpha,\beta):=C(\alpha)-\beta is the attractor of the collection of similarities of the form f(x)=bp(x+=1p(abp+ub))f(x)=b^{-p}(x+\sum_{\ell=1}^{p}(a_{\ell}b^{p-\ell}+u_{\ell}b^{-\ell})) where aa_{\ell} and uu_{\ell} can be any of the elements in AA_{\ell} and UU_{\ell} respectively.

Suppose hh and gg are functions of that form and suppose there exist x1x_{1}, x2C(α,β)x_{2}\in C(\alpha,\beta) such that h(x1)=g(x2)h(x_{1})=g(x_{2}). Let us denote the parameters of hh and gg by a(h),u(h)a_{\ell}^{(h)},u_{\ell}^{(h)} and a(g),u(g)a_{\ell}^{(g)},u_{\ell}^{(g)} respectively. By xk=π(xj(k))j=1x_{k}=\pi(x_{j}^{(k)})_{j=1}^{\infty} for k=1,2k=1,2 where xj(k)(D(D+αj))βjx_{j}^{(k)}\in(D\cap(D+\alpha_{j}))-\beta_{j}. It follows that

(104) h(x1)\displaystyle h(x_{1}) =0.ba1(h)ap(h)(u1(h)+x1(1))(up(h)+xp(1))xp+1(1)xp+2(1)\displaystyle=0._{b}a_{1}^{(h)}\ldots a_{p}^{(h)}(u_{1}^{(h)}+x_{1}^{(1)})\ldots(u_{p}^{(h)}+x_{p}^{(1)})x_{p+1}^{(1)}x_{p+2}^{(1)}\ldots
(105) g(x2)\displaystyle g(x_{2}) =0.ba1(g)ap(g)(u1(g)+x1(2))(up(g)+xp(2))xp+1(2)xp+2(2)\displaystyle=0._{b}a_{1}^{(g)}\ldots a_{p}^{(g)}(u_{1}^{(g)}+x_{1}^{(2)})\ldots(u_{p}^{(g)}+x_{p}^{(2)})x_{p+1}^{(2)}x_{p+2}^{(2)}\ldots

where we recall that for k=1,2k=1,2, x(k)x_{\ell}^{(k)} is an element of AA_{\ell} for =1,2,,p\ell=1,2,\ldots,p and of A+UA_{\ell}+U_{\ell} for >p\ell>p. It follows that both (104) and (105) are radix expansions in base (b,Δ)(b,\Delta). Since Δ\Delta is sparse, it follows from Lemma 4.8 that a(h)=a(g)a_{\ell}^{(h)}=a_{\ell}^{(g)} and u(h)+x(1)=u(g)+x(2)u_{\ell}^{(h)}+x_{\ell}^{(1)}=u_{\ell}^{(g)}+x_{\ell}^{(2)} for each =1,2,,p\ell=1,2,\ldots,p. The assumption |A+U|=|A||U||A_{\ell}+U_{\ell}|=|A_{\ell}||U_{\ell}| implies that x(1)=x(2)x_{\ell}^{(1)}=x_{\ell}^{(2)} and, in particular, u(h)=u(g)u_{\ell}^{(h)}=u_{\ell}^{(g)}. We conclude that h=gh=g. If hgh\neq g, then h(C(α,β))h(C(\alpha,\beta)) and g(C(α,β))g(C(\alpha,\beta)) are disjoint.

By Theorem 2.5, the box-counting, Hausdorff, and packing dimensions of C(α,β)C(\alpha,\beta), and thus C(α)C(\alpha) are both equal to the value ss satisfying Π=1p|A||U|=|b|sp\Pi_{\ell=1}^{p}|A_{\ell}||U_{\ell}|=|b|^{sp}. ∎

We end by computing the dimension of the set Cn,D(Cn,D+α)C_{n,D}\cap(C_{n,D}+\alpha) given in Example 4.7 a second time.

Example 5.15.

Let b=3+ib=-3+i. Suppose we choose D={0,4}D=\{0,4\}. Therefore we have Δ={4,0,4}\Delta=\{-4,0,4\}. The intersection of CC and its translation by α=28+24i19+26i=0.404¯\alpha=\frac{-28+24i}{-19+26i}=0.\overline{-404} is nonempty. We compute its box-counting, Hausdorff, and packing dimensions.

Not only is m=42m=4\geq 2, but by Lemma 4.8, the radix expansion of α\alpha in base (b,Δ)(b,\Delta) is unique. Therefore we can apply Corollary 5.13. The sequence (4|αj|)j=1(4-|\alpha_{j}|)_{j=1}^{\infty} is equal to 040¯\overline{040}. Matching the notation of Corollary 5.13, we have p=3p=3, a1=a3=0a_{1}=a_{3}=0, a2=4a_{2}=4 and u1=u2=u3=0u_{1}=u_{2}=u_{3}=0. Therefore

(106) dimB(C(α))=4log212log10=log23log10.\dim_{B}(C(\alpha))=\frac{4\log{2}}{12\log{10}}=\frac{\log{2}}{3\log{10}}.

Acknowledgement

The author would like to thank Professor Derong Kong at Chongqing University for his observations that improved the strength of some of the results and the quality of the manuscript. The author is also grateful for the continued support of his doctoral advisors, Francesco Cellarosi and James Mingo, whose comments improved the readability of the manuscript.

References

  • [1] G.J. Davis and T.-Y. Hu. On the intersection of two middle third Cantor sets. Pub. Math., 39:43–60, 1995.
  • [2] G-T. Deng, X-G. He, and Z-X. Wen. Self-similar structure on intersection of triadic Cantor sets. J. Math. Anal. Appl., 337:617–631, 2008.
  • [3] K. Falconer. Fractal Geometry:Mathematical Foundations and Applications. John Wiley and Sons, 1990.
  • [4] K. Falconer. Techniques in Fractal Geometry. John Wiley and Sons, 1997.
  • [5] W. J. Gilbert. Radix representations of quadratic fields. J. Math. Anal. Appl., 83:264–274, 1981.
  • [6] W. J. Gilbert. Complex numbers with three radix expansions. Can. J. Math., 34:1335–1348, 1982.
  • [7] S. Hua, H. Rao, Z. Wen, and J. Wu. On the structures and dimensions of Moran sets. Science in China, 43:836–852, 2000.
  • [8] Y. Huang and D. Kong. Intersections of middle-α\alpha Cantor sets with a fixed translation. Nonlinearity, 36:1461–1490, 2023.
  • [9] J. E. Hutchinson. Fractals and self similarity. Indiana University Mathematics Journal, 30:713–747, 1981.
  • [10] I. Katai and B. Kovács. Canonical number systems in imaginary quadratic systems. Acta Math. Acad. Sci. Hungar., 39:159–164, 1981.
  • [11] I. Katai and J. Szabo. Canonical number systems for complex integers. Acta Sci. Math, 37:255–260, 1975.
  • [12] D. Knuth. An imaginary number system. Comm. ACM, 3:245–247, 1960.
  • [13] D. Kong. On the self similarity of generalized Cantor sets. Sci. Sin. Math, 44:945–956, 2014.
  • [14] D. Kong, W. Li, and M. Dekking. Intersections of homogeneous Cantor sets and beta-expansions. Nonlinearity, 23:2815–2834, 2010.
  • [15] W. Li and X. Dongmei. Self-similar structure on intersection of homogeneous symmetric Cantor sets. Acta Math. Scientia, 19:214–219, 1999.
  • [16] W. Li, Y. Yao, and Y. Zhang. Self-similar structure on intersection of homogeneous symmetric Cantor sets. Math. Nachr., 284:298–316, 2011.
  • [17] F. Nekka and J. Li. Intersections of triadic Cantor sets with their rational translates. Chaos Solitons Fractals, 13:1807–1817, 2002.
  • [18] F. Nekka and J. Li. Intersections of triadic Cantor sets with their translates. ii Hausdorff measure spectrum function and its introduction for the classification of Cantors sets. Chaos Solitons Fractals, 19:35–46, 2004.
  • [19] S. Pedersen and J. D. Philips. Intersections of certain deleted digit sets. Fractals, 20:105–115, 2012.
  • [20] S. Pedersen and J. D. Philips. On intersections of Cantor sets: Hausdorff measure. Opuscula Math., 33:575–598, 2013.
  • [21] S. Pedersen and J. D. Philips. On intersections of Cantor sets: self-similarity. Commun. Math. Anal., 16:1–30, 2014.
  • [22] S. Pedersen and V. T. Shaw. Dimension of the intersection of certain Cantor sets in the plane. Opuscula Math, 41:227–244, 2021.
  • [23] K. Scheicher and J. M. Thuswaldner. Neighbours of self-affine tiles in lattice tilings. In Fractals in Graz 2001, pages 241–262. Birkhäuser Basel, 2003.
  • [24] Y. Zou, W. Li, and C. Yan. Intersecting nonhomogeneous Cantor sets with their translations. Nonlinear Analysis, 74:4660–4670, 2011.
  • [25] Y. Zou, J. Lu, and W. Li. Self-similar structure on the intersection of middle-(1β)(1-\beta) Cantor sets with β(1/3,1/2)\beta\in(1/3,1/2). Nonlinearity, 21:2899–2910, 2008.