Exact Hausdorff and packing measures of linear Cantor sets with overlaps

preprint2013arXivOpen access

Abstract

Let KK be the attractor of a linear iterated function system (IFS) Sj(x)=ρjx+bj,S_j(x)=ρ_jx+b_j, j=1,⋯ ,mj=1,\cdots,m, on the real line satisfying the generalized finite type condition (whose invariant open set O\mathcal{O} is an interval) with an irreducible weighted incidence matrix. This condition was introduced by Lau \& Ngai recently as a natural generalization of the open set condition, allowing us to include many important overlapping cases. They showed that the Hausdorff and packing dimensions of KK coincide and can be calculated in terms of the spectral radius of the weighted incidence matrix. Let αα be the dimension of KK. In this paper, we state that \begin{equation*} \mathcal{H}^α(K\cap J)\leq |J|^α\end{equation*} for all intervals J⊂O‾J\subset\overline{\mathcal{O}}, and \begin{equation*} \mathcal{P}^α(K\cap J)\geq |J|^α\end{equation*} for all intervals J⊂O‾J\subset\overline{\mathcal{O}} centered in KK, where Hα\mathcal{H}^α denotes the αα-dimensional Hausdorff measure and Pα\mathcal{P}^α denotes the αα-dimensional packing measure. This result extends a recent work of Olsen where the open set condition is required. We use these inequalities to obtain some precise density theorems for the Hausdorff and packing measures of KK. Moreover, using these densities theorems, we describe a scheme for computing Hα(K)\mathcal{H}^α(K) exactly as the minimum of a finite set of elementary functions of the parameters of the IFS. We also obtain an exact algorithm for computing Pα(K)\mathcal{P}^α(K) as the maximum of another finite set of elementary functions of the parameters of the IFS. These results extend previous ones by Ayer \& Strichartz and Feng, respectively, and apply to some new classes allowing us to include linear Cantor sets with overlaps.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.