The Julia set of a post-critically finite endomorphism of \(\mathbb{PC}^2\) (Q692769)

The article under review explores the combinatorial structure of the Julia set in \(\mathbb{P C}^2\) of the mapping \(f (z, w) = ((1 - 2 z / w)^2, (1 - 2/ w)^2)\). This map appeared in [\textit{L. Bartholdi} and \textit{V. Nekrashevych}, Acta Math. 197, No. 1, 1--51 (2006; Zbl 1176.37020)] and [\textit{J. E. Fornæss} and \textit{N. Sibony}, Contemp. Math. 137, 245--260 (1992; Zbl 0772.58024)]. The author applies the elaborate techniques of self-similar groups and iterated monodromy groups to the study of the combinatorial structure of the Julia set. Hubbard trees have been used to study the combinatorics of post-critically finite polynomials. The iterated monodromy group can be used with the same purpose. An example of such use in one complex variable is given in [Bartholdi and Nekrashevych, loc. cit.]. Section 3 of the article contains a self-contained description (without proofs) of the theory of self-similar groups and iterated monodromy groups and gives references [\textit{V. Nekrashevych}, Self-similar groups. Mathematical Surveys and Monographs 117. Providence, RI: American Mathematical Society (AMS) (2005; Zbl 1087.20032); Ergodic Theory Dyn. Syst. 34, No. 3, 938--985 (2014; Zbl 1350.37034)] for the details. Here an interesting and fruitful application of the theory is made to the combinatorial modelling of this two-dimensional system. For the map \(f\), the post-critical set \(V\) consists of a finite number of lines (see Section 2). The iterated monodromy group \(\mathrm{IMG} (f)\) is computed with respect to the complement \(\mathbb{P C}^2 \backslash V\): it is the quotient of the first fundamental group of \(\mathbb{P C}^2 \backslash V\) by the intersection, over all \(n \geq 0\), of the kernels of the monodromy of \(\pi_1(\mathbb {PC}^2 \backslash V, t)\) on the fiber of \(f^{- n} (t)\) (\(t\) is a base point, see Definition 3.13). Theorem 4.3 gives a description of \(\mathrm{IMG} (f)\) in terms of wreath recursion, hence providing it with a self-similar group structure. This self-similar group is contracting, that is, there exists a finite subset of \(\mathrm{IMG} (f)\) which is absorbing under the iteration of the wreath recursion. Such systems can be seen as automatons and thus yield a polyhedral model based on their Moore diagram. The action of \(\mathrm{IMG} (f)\) is used to model the action of \(f\) on the Julia set as an inverse limit (Theorem 5.7). This inverse limit is related to the polyhedral model by a pasting procedure described by Proposition 5.8. The spaces appearing in the sequence of the inverse limit are identified with subsets of the Julia set which are preimages of convex hulls inside dendritic slices of the Julia set (see Proposition 6.8).