Covering number on inhomogeneous graph-directed self-similar sets

Read full text
Authors: Balázs Bárány, Antti Käenmäki, Petteri Nissinen
Cited by: 1

Abstract

For a strongly connected inhomogeneous graph-directed self-similar set K^{C} satisfying the strong open set condition, we characterize the asymptotic behaviour of the r -covering number N_{r}(K^{C}) as r \downarrow 0 in terms of the Minkowski dimension s_{0}(G) of the attractor. If \int_{0}^{\infty} e^{-s_0(G)t}N_{e^{-t}}(C_{i}){\text{d}}t

Fields of Study & Subjects

Mathematical Dynamics and Fractals Limits and Structures in Graph Theory Geometric and Algebraic Topology

Publication details

Journal / source
Journal of Fractal Geometry Mathematics of Fractals and Related Topics
Publisher
European Mathematical Society - EMS - Publishing House GmbH
Volume
13
Issue
3
Pages
241–262
Publication date
11 June 2026
Language
EN