Convergence and pre-images of limit points for coding trees for iterations of holomorphic maps (Q916828)

We prove that except for a ``thin'' set of exceptional branches all branches of a ``geometric coding tree'' for iteration of a holomorphic map in the Riemann sphere \({\hat {\mathbb{C}}}\) are convergent. We prove also for the arising coding map that for every limit point in \({\hat {\mathbb{C}}}\) the pre-image set is ``thin''. This generalizes and gives an iteration theory version of Beurling's theorem that for a holomorphic, univalent function on the unit disc \({\mathbb{D}}\) radial limits exist everywhere except a set in \(\partial {\mathbb{D}}\) of logarithmic capacity 0 and for every limit point the set in \(\partial {\mathbb{D}}\) the radii of which converge to that point is also of logarithmic capacity 0.