Abstract
Let T(q,D) be a self-similar (fractal) set generated by \( \left\{ {fi(x) = \frac{1} {q}(x + d_i )} \right\}_{i = 1}^N \) where integer q > 1 and D = {d1, d2, …, dN} ⊂ ℝ. To show the Lipschitz equivalence of T(q,D) and a dust-like T(q,C), one general restriction is D ⊂ ℚ by Peres et al. [Israel J 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
