Related papers: Area of Julia sets of non-renormalizable cubic pol…
We prove the existence of quadratic polynomials having a Julia set with positive Lebesgue measure in three cases: the presence of a Cremer fixed point, the presence of a Siegel disk, the presence of infinitely many (satellite)…
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$…
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 small perturbation of a quadratic polynomial with a non-repelling fixed point gives a polynomial with an attracting fixed point and a Jordan curve Julia set, on which the perturbed polynomial acts like angle doubling. However, there are…
The no invariant line fields conjecture is one of the main outstanding problems in traditional complex dynamics. In this paper we consider non-autonomous iteration where one works with compositions of sequences of polynomials with suitable…
In general, little is known about the exact topological structure of Julia sets containing a Cremer point. In this paper we show that there exist quadratic Cremer Julia sets of positive area such that for a full Lebesgue measure set of…
It has been shown that the Sierpi\'nski gasket-like sets can appear as the Julia sets of some geometrically finite rational maps. In this paper we prove that such type of Julia sets can also appear in the rational maps containing Siegel…
In this paper we shall show that there exists L_0 such that for each even integer L >= L_0 there exists $c_1 \in \rz$ for which the Julia set of $z --> z^L + c_1$ has positive Lebesgue measure. This solves an old problem. Editor's note: In…
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…
The dynamics of all quadratic Newton maps of rational functions are completely described. The Julia set of such a map is found to be either a Jordan curve or totally disconnected. It is proved that no Newton map with degree at least three…
In the famous work by Buff and Ch\'eritat constructing quadratic Julia sets with positive area, the control of the shape of perturbed Siegel disks is a key technique. To do it, Buff and Ch\'eritat added a restrictive condition on rotation…
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…
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.
Let $f:\widehat{\mathbb{C}}\rightarrow \widehat{\mathbb{C}}$ be a hyperbolic rational map of degree $d \geq 2$, and let $J \subset \mathbb{C}$ be its Julia set. We prove that $J$ always has positive Fourier dimension. The case where $J$ is…
We show that if a polynomial filled Julia set has empty interior, then it is computable.
For any polynomial diffeomorphism $f$ of $\mathbb{C}^2$ with positive entropy, neither the Julia set of $f$ nor of its inverse $f^{-1}$ is $C^1$ smooth as a manifold-with-boundary.
We prove the existence of rational maps whose Julia sets are Sierpi\'{n}ski carpets having positive area. Such rational maps can be constructed such that they either contain a Cremer fixed point, a Siegel disk or are infinitely…
We prove the existence of rational maps having smooth degenerate Herman rings. This answers a question of Eremenko affirmatively. The proof is based on the construction of smooth Siegel disks by Avila, Buff and Ch\'{e}ritat as well as the…
We prove that the Julia set of a rational function $f$ is computable in polynomial time, assuming that the postcritical set of $f$ does not contain any critical points or parabolic periodic orbits.
We give examples of infinitely renormalizable quadratic polynomials $F_c: z\maps to z^2+c$ with stationary combinatorics whose Julia sets have Hausdorff dimension arbitrar y close to 1. The combinatorics of the renormalization involved is…