Search

In 2021, Mork and Ulness studied the Mandelbrot and Julia sets for a generalization of the well-explored function hl(z) = z2 +l. Their generalization was based on the composition of hl with the Möbius transformation m(z) = 1z at each iteration step. Furthermore, they posed a conjecture providing a relation between the coefficients of (each order) iterated series of m(hl(z)) (at z = 0) and the Catalan numbers. In this paper, in particular, we prove this conjecture in a more precise (quantitative) formulation. [ABSTRACT FROM AUTHOR]

Escape time algorithm is a classical algorithm to calculate the Julia sets, but it has the disadvantage of dull color and cannot record the iterative process of the points. In this paper, we present the equipotential point algorithm to calculate the Julia sets by recording the strike frequency of the points in the iterative process. We calculate and analyze the Julia sets in the complex plane by using this algorithm. Finally, we discuss the iteration trajectory of a single point. [ABSTRACT FROM AUTHOR]

We show that, for many parameters aϵC, the set I(fa) of points that converge to infinity under iteration of the exponential map fa(z) = ez + a is connected. This includes all parameters for which the singular value a escapes to infinity under iteration of fa. [ABSTRACT FROM AUTHOR]