Fractal interpolation function (FIF) is a special type of continuous function which interpolates certain data set and the attractor of the Iterated Function System (IFS) corresponding to a data set is the graph of the...Fractal interpolation function (FIF) is a special type of continuous function which interpolates certain data set and the attractor of the Iterated Function System (IFS) corresponding to a data set is the graph of the FIF. Coalescence Hidden-variable Fractal Interpolation Function (CHFIF) is both self-affine and non self-affine in nature depending on the free variables and constrained free variables for a generalized IFS. In this article, graph directed iterated function system for a finite number of generalized data sets is considered and it is shown that the projection of the attractors on is the graph of the CHFIFs interpolating the corresponding data sets.展开更多
Some kinds of the self-similar sets with overlapping structures are studied by introducing the graph-directed constructions satisfying the open set condition that coincide with these sets. In this way, the dimensions ...Some kinds of the self-similar sets with overlapping structures are studied by introducing the graph-directed constructions satisfying the open set condition that coincide with these sets. In this way, the dimensions and the measures are obtained.展开更多
In this paper, we study the connectedness of the invariant sets of a graph-directed iterated function system（IFS）. For a graph-directed IFS with N states, we construct N graphs. We prove that all the invariant sets ...In this paper, we study the connectedness of the invariant sets of a graph-directed iterated function system（IFS）. For a graph-directed IFS with N states, we construct N graphs. We prove that all the invariant sets are connected, if and only if all the N graphs are connected; in this case, the invariant sets are all locally connected and path connected. Our result extends the results on the connectedness of the self-similar sets.展开更多
Some kinds of the self-similar sets with overlapping structures are studied by introducing the graph-directed constructions satisfying the open set condition that coincide with these sets. In this way, the dimensions ...Some kinds of the self-similar sets with overlapping structures are studied by introducing the graph-directed constructions satisfying the open set condition that coincide with these sets. In this way, the dimensions and the measures are obtained.展开更多
A set in Rd 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..
This paper investigates the Lipschitz equivalence of generalized {1,3,5}-{1,4,5} self-similar sets D=(r_1D)∪(r_2D+(1+r_1-r_2-r_3)/2)∪(r_3D+1+r_3) and E=(r_1E)∪(r_2E+1-r_2- r_3)∪(r_3E+1-r_3),and proves that D and E...This paper investigates the Lipschitz equivalence of generalized {1,3,5}-{1,4,5} self-similar sets D=(r_1D)∪(r_2D+(1+r_1-r_2-r_3)/2)∪(r_3D+1+r_3) and E=(r_1E)∪(r_2E+1-r_2- r_3)∪(r_3E+1-r_3),and proves that D and E are Lipschitz equivalent if and only if there are positive integers m and n such that r_1~m=r_3~n.展开更多
Let T（q, D） be a self-similar （fractal） set generated by {fi（x） = 1/q（（x ＋ di）}^Ni=1 where integer q 〉 1and D = {d1, d2 dN} C R. To show the Lipschitz equivalence of T（q, D） and a dust-iik-e T（q, C）, on...Let T（q, D） be a self-similar （fractal） set generated by {fi（x） = 1/q（（x ＋ di）}^Ni=1 where integer q 〉 1and D = {d1, d2 dN} C R. To show the Lipschitz equivalence of T（q, D） and a dust-iik-e T（q, C）, one general restriction is 79 C Q by Peres et al. [Israel] Math, 2000, 117： 353-379]. In this paper, we obtain several sufficient criterions for the Lipschitz equivalence of two self-similar sets by using dust-like graph-directed iterating function systems and combinatorial techniques. Several examples are given to illustrate our theory.展开更多
文摘Fractal interpolation function (FIF) is a special type of continuous function which interpolates certain data set and the attractor of the Iterated Function System (IFS) corresponding to a data set is the graph of the FIF. Coalescence Hidden-variable Fractal Interpolation Function (CHFIF) is both self-affine and non self-affine in nature depending on the free variables and constrained free variables for a generalized IFS. In this article, graph directed iterated function system for a finite number of generalized data sets is considered and it is shown that the projection of the attractors on is the graph of the CHFIFs interpolating the corresponding data sets.
基金Project supported by the National Natural Science Foundation of China and Mathematics Center ofMorningside, Chinese Academy Sc
文摘Some kinds of the self-similar sets with overlapping structures are studied by introducing the graph-directed constructions satisfying the open set condition that coincide with these sets. In this way, the dimensions and the measures are obtained.
基金Supported by the Teaching Research Project of Hubei Province(2013469)the 12th Five-Year Project of Education Plan of Hubei Province(2014B379)
文摘In this paper, we study the connectedness of the invariant sets of a graph-directed iterated function system（IFS）. For a graph-directed IFS with N states, we construct N graphs. We prove that all the invariant sets are connected, if and only if all the N graphs are connected; in this case, the invariant sets are all locally connected and path connected. Our result extends the results on the connectedness of the self-similar sets.
基金Project supported by the National Natural Science Foundation of China and Mathematics Center ofMorningside, Chinese Academy Sc
文摘Some kinds of the self-similar sets with overlapping structures are studied by introducing the graph-directed constructions satisfying the open set condition that coincide with these sets. In this way, the dimensions and the measures are obtained.
文摘A set in Rd 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..
基金This work was partially supported by the National Natural Science Foundation of China(Grant Nos.10301029,10671180,10601049) and Morningside Center of Mathematics
文摘This paper investigates the Lipschitz equivalence of generalized {1,3,5}-{1,4,5} self-similar sets D=(r_1D)∪(r_2D+(1+r_1-r_2-r_3)/2)∪(r_3D+1+r_3) and E=(r_1E)∪(r_2E+1-r_2- r_3)∪(r_3E+1-r_3),and proves that D and E are Lipschitz equivalent if and only if there are positive integers m and n such that r_1~m=r_3~n.
基金supported by National Natural Science Foundation of China (Grant No.10871180)
文摘Let T（q, D） be a self-similar （fractal） set generated by {fi（x） = 1/q（（x ＋ di）}^Ni=1 where integer q 〉 1and D = {d1, d2 dN} C R. To show the Lipschitz equivalence of T（q, D） and a dust-iik-e T（q, C）, one general restriction is 79 C Q by Peres et al. [Israel] Math, 2000, 117： 353-379]. In this paper, we obtain several sufficient criterions for the Lipschitz equivalence of two self-similar sets by using dust-like graph-directed iterating function systems and combinatorial techniques. Several examples are given to illustrate our theory.
