The Hausdorff dimension of a class of recurrent sets (Q2368676): Difference between revisions

\textit{F. M. Dekking} [Adv. Math. 44, 78--104 (1982; Zbl 0495.51017)] introduced a method to describe and generate fractal sets, called recurrent sets. In the same paper, an upper bound for the Hausdorff dimension of a recurrent set was given. For similitudes, Dekking conjectured that the Hausdorff dimension of the associated recurrent set is equal to the upper bound iff resolvability holds. If the linear map in the Dekking construction is not a similitude, it is difficult to calculate the dimension of the recurrent set. The authors obtain a lower bound for the Hausdorff dimension of a recurent set defined by a non-similitude and show that the Dekking conjecture is true in the general setting.