No label defined (Q4393476)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1161560
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1161560

      Statements

      0 references
      10 June 1998
      0 references
      self-similar set
      0 references
      Hölder continuous mapping
      0 references
      similarity dimension
      0 references
      Hausdorff dimension
      0 references
      division system
      0 references
      If a non-empty compact connected set \(K\subset{\mathbb R}^d\) is the invariant set of a family \({\mathcal S}=\{S_1, S_2,\ldots,\) \(S_m\}\) of (contractive) similitudes of \({\mathbb R}^d\), then there is a continuous onto mapping \(f:[0,1]\to K\), called the parametrization of K. Marko Remes investigates in his thesis (the work under review) the possibility of parametrization of such a self-similar set \(K\) by an \(\alpha\)-Hölder continuous mapping \(f\), \(\alpha=1/s\), where \(s\) is the Hausdorff dimension of the set \(K\). For space filling curves, such as Peano and Hilbert curve, and for classical self-similar sets, known as Koch curve and Sierpiński gasket, it is known that such parametrizations exist, and the corresponding Hölder exponent is the best possible, i.e., it is the biggest possible. In his thesis the author finds some classes of self-similar sets for which there exists a Hölder continuous parametrization with the best possible Hölder exponent. One of these classes is that of connected self-similar sets satisfying the generalized open set condition. The proof of the existence of the mentioned parametrization is constructive. First it is defined a tree related to the inner structure of the set \(K\). If the tree contains no branches the parametrization is constructed easily. Otherwise, one associates a sequence of graphs \(A(n)\) whose vertex sets converge in the Hausdorff metric to the set \(K\). In this case the parametrization is defined by defining a path to the graphs \(A(n)\), and then by associating polygonal lines to the path. Parametrizations of these polygonal lines converge to the desired parametrization of the set \(K\). This method of parametrization also can be applied to self-similar sets which can be decomposed into a finite collection of connected components. In the second part of the thesis the author develops a tool, called complete division system of a family of similitudes, to find parametrizations for self-similar sets. A division system is in fact a finite sequence of positive numbers \(c_0,c_1,\ldots, c_k\) satisfying some conditions. A division system of a family \({\mathcal S}\) of similitudes having \(K\) as invariant set of similarity dimension \(s\) implies the existence of a unique \(k\)-vector \((g_0,g_1,\ldots, g_k)\) of \(1/s\) Hölder continuous functions \(g_i:[0,c_i]\to K\). If \(g_0([0,c_0])=K\) the division system is called complete. Hence, if one can find a complete division system for \(\mathcal S\), then one can construct a parametrization of \(K\) with the best possible Hölder exponent. As an application of this result, it is proved that every self-similar set \(K\) satisfying the so-called \(D'\)-condition or \(D2\)-condition can be parametrized by a \(1/s\) Hölder exponent, where \(s\) is the similarity dimension of the set \(K\). The methods, tools and techniques developed and used by the author in his attempt to find parametrizations for some classes of self-similar sets constitute a valuable contribution to the literature concerning these sets.
      0 references

      Identifiers