English

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 KCK^C satisfying the strong open set condition, we characterize the asymptotic behaviour of the rr-covering number Nr(KC)N_r(K^C) as r0r \downarrow 0 in terms of the Minkowski dimension s0(G)s_0(G) of the attractor. If 0es0(G)tNet(Ci)dt<\int_0^\infty e^{-s_0(G)t}N_{e^{-t}}(C_i)\,\mathrm{d} t<\infty for all vertices ii, then es0(G)tNet(KC)e^{-s_0(G)t}N_{e^{-t}}(K^C) has a limit as tt\to\infty, which is a positive constant when the log-contraction group GMG_M is R\mathbb{R} and a positive periodic function when GMG_M is a lattice; if the integral diverges for some ii, 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