A Local Property of Hausdorff Centered Measure of Self-Similar Sets

We analyze the local behavior of the Hausdorff centered measure for selfsimilar sets. If E is a self-similar set satisfying the open set condition, then Cs(E∩B(x,r)) ≤(2r)s for all x ∈ E and r 0, where Csdenotes the s-dimensional Hausdorff centered measure. The above inequality is used to obtain the upper bound of the Hausdorff centered measure. As the applications of above inequality, We obtained the upper bound of the Hausdorff centered measure for some self-similar sets with Hausdorff dimension equal to 1, and prove that the upper bound reach the exact Hausdorff centered measure.     

The Hausdorff Dimension of Sections

The notion of finite-type open set condition is defined to calculate the Hausdorff dimensions of the sections of some self-similar sets, such as the dimension of intersection of the Koch curve and the line x = a with a∈Q.     

Self-similar fractals: An algorithmic point of view

This paper studies the self-similar fractals with overlaps from an algorithmic point of view.A decidable problem is a question such that there is an algorithm to answer"yes"or"no"to the question for every possible input.For a classical class of self-similar sets{E b.d}b,d where E b.d=Sn i=1(E b,d/d+b i)with b=(b1,...,b n)∈Qn and d∈N∩[n,∞),we prove that the following problems on the class are decidable:To test if the Hausdorff dimension of a given self-similar set is equal to its similarity dimension,and to test if a given self-similar set satisfies the open set condition(or the strong separation condition).In fact,based on graph algorithm,there are polynomial time algorithms for the above decidable problem.     

THE REGULARITY OF RANDOM GRAPH DIRECTED SELF-SIMILAR SETS

A set in R^d is called regular if its Hausdorff dimension coincides with its upper box counting dimension. It is proved that a random graph-directed self-similar set is regular a.e..     

A Note on Upper Convex Density

For a self-similar set E satisfying the open set condition,upper convex density is an important concept for the computation of its Hausdorff measure,and it is well known that the set of relative interior points with upper convex density 1 has a full Hausdorff measure.But whether the upper convex densities of E at all the relative interior points are equal to 1？ In other words,whether there exists a relative interior point of E such that the upper convex density of E at this point is less than 1？ In this paper,the authors construct a self-similar set satisfying the open set condition,which has a relative interior point with upper convex density less than 1.Thereby,the above problem is sufficiently answered.     

Dimension of Slices Through Fractals with Initial Cubic Pattern

In this paper, the Hausdorff dimension of the intersection of self-similar fractals in Euclidean space R~n generated from an initial cube pattern with an(n-m)-dimensional hyperplane V in a fixed direction is discussed. The authors give a sufficient condition which ensures that the Hausdorff dimensions of the slices of the fractal sets generated by "multirules" take the value in Marstrand's theorem, i.e., the dimension of the self-similar sets minus one. For the self-similar fractals generated with initial cube pattern, this sufficient condition also ensures that the projection measure μVis absolutely continuous with respect to the Lebesgue measure L~m. When μV《 L~m, the connection of the local dimension ofμVand the box dimension of slices is given.     

I.I.D. STATISTICAL CONTRACTION OPERATORS AND STATISTICALLY SELF－SIMILAR SETS

I.i.d. random sequence is the simplest but very basic one in stochastic processes, and statistically self-similar set is the simplest but very basic one in random recursive sets in the theory of random fractal. Is there any relation between i.i.d. random sequence and statistically self-similar set? This paper gives a basic theorem which tells us that the random recursive set generated by a collection of i.i.d. statistical contraction operators is always a statistically self-similar set.     

Gap Property of Bi-Lipschitz Constants of Bi-Lipschitz Automorphisms on Self-similar Sets

For a given self-similar set E ∪→ R^d satisfying the strong separation condition, let Aut（E） be the set of all bi-Lipschitz automorphisms on E. The authors prove that {f ∈ Aut（E） ： blip（f） = 1} is a finite group, and the gap property of bi-Lipschitz constants holds, i.e., inf{blip（f） ≠ 1： f ∈ Aut（E）} 〉 1, where lip（g） =sup x,y∈E x≠y ｜g（x）-g（y）｜/｜x-y｜ and blip（g） =max（lip（g）, liP（g^-1））.     

Hausdorff dimension of Julia set of a polynomial with a Siegel disk

Let f(z) = e2πiθz(1 z/d)d,θ∈R\Q be a polynomial. Ifθis an irrational number of bounded type, it is easy to see that f(z) has a Siegel disk centered at 0. In this paper, we will show that the Hausdorff dimension of the Julia set of f(z) satisfies Dim(J(f))<2.     

DNA labelled graphs with DNA computing

Let k≥2, 1≤i≤k andα≥1 be three integers. For any multiset which consists of some k-long oligonucleotides, a DNA labelled graph is defined as follows: each oligonucleotide from the multiset becomes a point; two points are connected by an arc from the first point to the second one if the i rightmost uucleotides of the first point overlap with the i leftmost nucleotides of the second one. We say that a directed graph D can be(k, i;α)-labelled if it is possible to assign a label(l_1(x),..., l_k(x))to each point x of D such that l_j(x)∈{0,...,a-1}for any j∈{1,...,k}and(x,y)∈E(D)if and only if(l_k-i 1(x),..., l_k(x))=(l_1(y),..., l_i(y)). By the biological background, a directed graph is a DNA labelled graph if there exist two integers k, i such that it is(k, i; 4)-labelled. In this paper, a detailed discussion of DNA labelled graphs is given. Firstly, we study the relationship between DNA labelled graphs and some existing directed graph classes. Secondly, it is shown that for any DNA labelled graph, there exists a positive integer i such that it is(2i, i; 4)-labelled. Furthermore, the smallest i is determined, and a polynomial-time algorithm is introduced to give a(2i, i; 4)-labelling for a given DNA labelled graph. Finally, a DNA algorithm is given to find all paths from one given point to another in a(2i, i; 4)-labelled directed graph.     

Sum of Cantor sets: Self-similarity and measure

In this note it is shown that the sum of two homogeneous Cantor sets is often a uniformly contracting self-similar set and it is given a sufficient condition for such a set to be of Lebesgue measure zero (in fact, of Hausdorff dimension less than one and positive Hausdorff measure at this dimension).

     

均匀三部分康托集的Hausdorff中心测度

均匀三部分康托集K(λ,3)是满足开集条件的自相似分形集．本文通过一个概率测度μ在点x的上球密度的计算给出了K(λ,3)的s维Hausdorff中心测度的精确值,其中s=logλ1/3是K(λ,3)的Hausdorff维数．     

Estimating the Hausdorff dimensions of univoque sets for self-similar sets

An approach is given for estimating the Hausdorff dimension of the univoque set of a self-similar set. This sometimes allows us to get the exact Hausdorff dimensions of the univoque sets.     

Haudorff测度与等径不等式

对于:Hausdorff维数为s>0的满足开集条件的自相似集E(?)Rn(n>1),我们引入等径不等式Hs|E(X)≤|X|s,以及使该不等式等号成立而直径大于0的极限集U(?)Rn.这里,Hs|E(·)是限制到集合E上的s维Hausdorff测度,而|X|指集合X在欧氏度量下的直径.当s=n时,n维球是唯一的极限集;当s∈(1,n)时,除去一些反面例子以外,我们对上述等径不等式的极限集的基本性质所知甚少.可以看出,这些不等式与Hs(E)的准确值的计算有密切联系.作为特例,我们将考虑Sierpinski垫片,指出计算这一典型自相似集的In2/In3维Hausdorff测度准确值的困难何在.由此可以大致推想,为什么除去平凡情形以外,至今还没有一个具体的满足开集条件而维数大于1的自相似集的:Hausdorff测度准确值被计算出来.     

A dimensional result for random self-similar sets

A very important property of a deterministic self-similar set is that its Hausdorff dimension and upper box-counting dimension coincide. This paper considers the random case. We show that for a random self-similar set, its Hausdorff dimension and upper box-counting dimension are equal

     

The strong open set condition in the random case

To describe some fractal properties of a self-similar set or measure, such as the Hausdorff dimension and the multifractal spectrum, it is useful that it satisfy the strong open set condition, which means there is an open set satisfying the open set condition and, additionally, a part of the self-similar set must meet the open set. It is known that in the non-random case the strong open set condition and the open set condition are equivalent. This paper treats the random case. If the open set condition is assumed, we show that there is a random open set satisfying the strong open set condition. Further, we give an application to multifractal analysis of the random self-similar fractal.

     

平面上一类自相似集的共形维数

本文证明了平面上一类自相似集的共形维数为1.此外还证明了这些自相似集与任何Hausdorff维数为1的度量空间都不是拟对称等价的.这表明,对于这些自相似集而言,共形维数定义中的下确界不能达到.     

关于自相似集的Hausdorff测度

得到了 Ｈａｕｓｄｏｒｆｆ容度与 Ｈａｕｓｄｏｒｆｆ测度相等的集的充分必要条件．对于满足开集条件的自相似集,验证了它的Ｈａｕｓｄｏｒｆｆ容度与Ｈａｕｓｄｏｒｆ测度相等并给出了它的Ｈａｕｓｄｏｒｆｆ测度的一个便于应用的公式．作为例子,给出了均匀康托集的Ｈａｕｓｄｏｒｆｆ测度的一种新的计算方法,对于Ｋｏｃｈ曲线的Ｈａｕｓｄｏｒｆｆ测度的上限也作了讨论．