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 \ zd + c, c ∈ C, d 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…