On the complexity of the set of codings for self-similar sets and a variation on the construction of Champernowne (Q2281344)

This paper deals with iterated function systems and is devoted to some properties of the set of encodings (codings). A general problem being the main motivation for investigations of the present article, is noted. A brief auxiliary survey, auxiliary references on similar researches, and references on researches demonstrating the important role of the set of encodings in the study of self-similar measures, are given. One of the most important problems in Fractal Geometry is noted. One can cite the abstract of the authors of this paper: ``Let \(F=\{\mathbf p_0,\ldots, \mathbf p_n\}\) be a collection of points in \(\mathbb{R}^d.\) The set \(F\) naturally gives rise to a family of iterated function systems consisting of contractions of the form \[ S_i(x)=\lambda \mathbf x +(1-\lambda)\mathbf p_i,~~~i=0,1,\dots , n, \] where \(\lambda \in(0,1)\) and \(\mathbf x \in \mathbb R^d\). Given \(F\) and \(\lambda\) it is well known that there exists a unique non-empty compact set \(X\) satisfying \(X=\bigcup_{i=0}^n {S_i(X)}\). For each \(\mathbf x \in X\) there exists a sequence \((a_j)^{\infty} _{j=1}\in\{0,\ldots,n\}^{\mathbb{N}}\) satisfying \[ \mathbf x=\lim_{j\to\infty}(S_{a_1}\circ \cdots \circ S_{a_j})(\mathbf{0}). \] We call such a sequence a coding of \(\mathbf x\). In this paper we prove that for any \(F\) and \(k \in\mathbb{N},\) there exists \(\delta_k(F)>0\) such that if \(\lambda\in(1-\delta_k(F),1),\) then every point in the interior of \(X\) has a coding which is \(k\)-simply normal. Similarly, we prove that there exists \(\delta_{uni}(F)>0\) such that if \(\lambda\in(1-\delta_{uni}(F),1),\) then every point in the interior of \(X\) has a coding containing all finite words. For some specific choices of \(F\) we obtain lower bounds for \(\delta_k(F)\) and \(\delta_{uni}(F)\). We also prove some weaker statements that hold in the more general setting when the similarities in our iterated function systems exhibit different rates of contraction. Our proofs rely on a variation of a well known construction of a normal number due to Champernowne, and an approach introduced by Erdős and Komornik.'' Some auxiliary notions are noted, codings (universal codings) introduced by Erdös and Komornik in terms of \(q\)-expansions of real numbers, are considered and generalized, and a variation on the construction of Champernowne is given (i.e., a construction of Champernowne is generalised). Certain auxiliary statements are proved. Obtained results are discussed, several conjectures are presented.