Covering number on inhomogeneous graph-directed self-similar sets
Dynamical Systems
2026-03-16 v3 Classical Analysis and ODEs
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 as , 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.
Keywords
Cite
@article{arxiv.2307.16263,
title = {Covering number on inhomogeneous graph-directed self-similar sets},
author = {Balázs Bárány and Antti Käenmäki and Petteri Nissinen},
journal= {arXiv preprint arXiv:2307.16263},
year = {2026}
}
Comments
17 pages