Related papers: Irreducible Julia sets of rational functions

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$ be a polynomial-like mapping of the sphere of degree $d \geq 2$. We show that the Julia set $J(f)$ of $f$ cannot be the union of a finite number of proper indecomposable subcontinua. As a corollary, we prove that $J(f)$ is an…

Makienko's conjecture, a proposed addition to Sullivan's dictionary, can be stated as follows: The Julia set of a rational function R has buried points if and only if no component of the Fatou set is completely invariant under the second…

We give an example of two rational functions with non-equal Julia sets that generate a rational semigroup whose completely invariant Julia set is a closed line segment. We also give an example of polynomials with unequal Julia sets that…

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

Adopting the approach of [7] we study rational function carrying invariant line fields on the Julia set. In particular, we show that under certain weak conditions all possible measurable invariant line fields of a rational function on its…

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…

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.

The Fatou-Julia iteration theory of rational functions has been extended to quasiregular mappings in higher dimension by various authors. The purpose of this paper is an analogous extension of the iteration theory of transcendental entire…

We study how the orbits of the singularities of the inverse of a meromorphic function prescribe the dynamics on its Julia set, at least up to a set of (Lebesgue) measure zero. We concentrate on a family of entire transcendental functions…

A hyperbolic transcendental entire function with connected Fatou set is said to be "of disjoint type". It is known that a disjoint-type function provides a model for the dynamics near infinity of all maps in the same parameter space; hence…

We show, in an elementary way, that the Julia set of one-complex-variable entire functions is nonempty and perfect.

We prove the existence of a transcendental entire function whose Julia set is a "bouquet of pseudo-arcs". More precisely, the union of the Julia set with infinity is an uncountable union of pseudo-arcs, which are pairwise disjoint except at…

The theory of polynomial-like maps is of fundamental importance in holomorphic dynamics. We study dynamical properties of a larger class of maps. Our main result is that, under some natural conditions, a map of this class has a completely…

For polynomials, local connectivity of Julia sets is a much-studied and important property. Indeed, when the Julia set of a polynomial of degree $d\geq 2$ is locally connected, the topological dynamics can be completely described as a…

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)…

In recent years, there has been significant progress in the understanding of the dynamics of transcendental entire functions with bounded postsingular set. In particular, for certain classes of such functions, a complete description of…

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…

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.

Any finite union of disjoint, mutually exterior Jordan curves in the complex plane can be approximated arbitrarily well in the Hausdorff topology by polynomial Julia sets. Furthermore, the proof is constructive.