Related papers: Computability of the Julia set. Nonrecurrent criti…

We present the first example of a poly-time computable Julia set with a recurrent critical point: we prove that the Julia set of the Feigenbaum map is computable in polynomial time.

In this paper we prove that parabolic Julia sets of rational functions are locally computable in polynomial time.

We show that if a polynomial filled Julia set has empty interior, then it is computable.

In this paper we settle most of the open questions on algorithmic computability of Julia sets. In particular, we present an algorithm for constructing quadratics whose Julia sets are uncomputable. We also show that a filled Julia set of a…

Let f and g two rational functions having the same Julia set J_f. Lets suppose that f has a rational indifferent periodic point and that the critical set of f is disjoint of J_f. Then or J_f has to be equal to P^1, a circle, an arc of a…

We show that under the definition of computability which is natural from the point of view of applications, there exist non-computable quadratic Julia sets.

The computability of Julia sets of rational maps on the Riemann sphere has been intensively studied in recent years (see, e.g. https://doi.org/10.17323/1609-4514-2008-8-2-185-231, https://doi.org/10.1090/conm/797/15936) for an overview. For…

In this paper, we prove that for any post-critically finite rational map $f$ on the Riemann sphere $\overline{\mathbb{C}}$, and for each sufficiently large integer $n$, there exists a finite and connected graph $G$ in the Julia set of $f$…

Let f be a rational function such that the multipliers of all repelling periodic points are real. We prove that the Julia set of such a function belongs to a circle. Combining this with a result of Fatou we conclude that whenever J(f)…

Let $ R $ be a rational map with totally disconnected Julia set $ J(R). $ If the postcritical set on $ J(R) $ contains a non-persistently recurrent (or conical) point, then we show that the map $ R $ can not be a structurally stable map.

We prove that a polynomial Julia set which is a finitely irreducible continuum is either an arc or an indecomposable continuum. For the more general case of rational functions, we give a topological model for the dynamics when the Julia set…

Let $f$ be a rational map with degree at least two. We prove that $f$ has at least $2$ disjoint and infinite critical orbits in the Julia set if it has a Herman ring. This result is sharp in the following sense: there exists a cubic…

We prove that Collet-Eckmann rational maps have poly-time computable Julia sets. As a consequence, almost all real quadratic Julia sets are poly-time.

We discuss computability of impressions of prime ends of compact sets. In particular, we construct quadratic Julia sets which possess explicitly described non-computable impressions.

A cubic polynomial $P$ with a non-repelling fixed point $b$ is said to be \emph{immediately renormalizable} if there exists a (connected) quadratic-like invariant filled Julia set $K^*$ such that $b\in K^*$. In that case exactly one…

A cubic polynomial $P$ with a non-repelling fixed point $b$ is said to be immediately renormalizable if there exists a (connected) QL invariant filled Julia set $K^*$ such that $b\in K^*$. In that case, exactly one critical point of $P$…

We completely characterize the conformal radii of Siegel disks in the family $$P_\theta(z)=e^{2\pi i\theta}z+z^2,$$ corresponding to {\bf computable} parameters $\theta$. As a consequence, we constructively produce quadratic polynomials…

If $f$ is a transcendental entire function with only algebraic singularities we calculate the Ruelle operator of $f$. Moreover, we prove both (i) if $f$ has a summable critical point, then $f$ is not structurally stable under certain…

We prove that every wandering exposed Julia component of a rational map is to a singleton, provided that each wandering Julia component containing critical points is non-recurrent. Moreover, we show that the Julia set contains only finitely…

A completely stable multicurve of a post-critically finite rational map induces a combinatorial decomposition. The projections of the small Julia sets are immersed within the original Julia set. We prove that two small Julia sets are…