Covering number on inhomogeneous graph-directed self-similar sets

  • Balázs Bárány

    Budapest University of Technology and Economics, Hungary
  • Antti Käenmäki

    University of Eastern Finland, Joensuu, Finland
  • Petteri Nissinen

    University of Eastern Finland, Joensuu, Finland
Covering number on inhomogeneous graph-directed self-similar sets cover

A subscription is required to access this article.

Abstract

For a strongly connected inhomogeneous graph-directed self-similar set satisfying the strong open set condition, we characterize the asymptotic behaviour of the -covering number as in terms of the Minkowski dimension of the attractor. If for all vertices , then has a limit , which is a positive constant when the log-contraction group is and a positive periodic function when is a lattice; if the integral diverges for some , the limit is infinite.

Cite this article

Balázs Bárány, Antti Käenmäki, Petteri Nissinen, Covering number on inhomogeneous graph-directed self-similar sets. J. Fractal Geom. (2026), published online first

DOI 10.4171/JFG/191