arXiv · 2206.03605
Mandelbrot sets for fixed template iterations
Abstract
We study the dynamics of template iterations, consisting of arbitrary compositions of functions chosen from a finite set of polynomials. In particular, we focus on templates using complex unicritical maps in the family $\{ z^d + c, c \in \mathbb{C}, d \ge 2 \}$. We examine the dependence on parameters of the connectedness locus for a fixed template and show that, for most templates, the connectedness locus moves upper semicontiuously. On the other hand, one does not in general have lower semicontinuous dependence, and we show this by means of a counterexample.
Explore related subjects
Keep this discovery
Mark Comerford, Anca Radulescu, Kieran Cavanagh. 2022-06-07. Mandelbrot sets for fixed template iterations. https://arxiv.org/abs/2206.03605
Cite the original work for its findings. Save a collection to share your selection of sources.