Dimension approximation of attractors of graph directed IFSs by self-similar sets

From MaRDI portal
Publication:5225818

DOI10.1017/S0305004118000282zbMATH Open1416.28010arXiv1505.05746OpenAlexW2962963422WikidataQ129330796 ScholiaQ129330796MaRDI QIDQ5225818FDOQ5225818


Authors: Ábel Farkas Edit this on Wikidata


Publication date: 29 July 2019

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Abstract: We show that for the attractor (K1,dots,Kq) of a graph directed iterated function system, for each 1leqjleqq and varepsilon>0 there exits a self-similar set KsubseteqKj that satisfies the strong separation condition and dimHKjvarepsilon<dimHK. We show that we can further assume convenient conditions on the orthogonal parts and similarity ratios of the defining similarities of K. Using this property as a `black box' we obtain results on a range of topics including on dimensions of projections, intersections, distance sets and sums and products of sets.


Full work available at URL: https://arxiv.org/abs/1505.05746




Recommendations



Cites Work


Cited In (8)





This page was built for publication: Dimension approximation of attractors of graph directed IFSs by self-similar sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225818)