Papers
Topics
Authors
Recent
Search
2000 character limit reached

Mandelbrot sets for fixed template iterations

Published 7 Jun 2022 in math.DS | (2206.03605v1)

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}\{ 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

YouTube

#15: Princess Mononoke rages against Image Generation 3 views