Related papers: On biaccessible points in the Julia set of a Creme…

It is shown that a polynomial with a Cremer periodic point has a non-accessible critical point in its Julia set provided that the Cremer periodic point is approximated by small cycles.

Let $f$ be a quadratic polynomial which has an irrationally indifferent fixed point $\alpha$. Let $z$ be a biaccessible point in the Julia set of $f$. Then: 1. In the Siegel case, the orbit of $z$ must eventually hit the critical point of…

Let $P$ be a polynomial of degree $d$ with a Cremer point $p$ and no repelling or parabolic periodic bi-accessible points. We show that there are two types of such Julia sets $J_P$. The \emph{red dwarf} $J_P$ are nowhere connected im…

Let $f:z\mapsto z^2+c$ be a quadratic polynomial whose Julia set $J$ is locally-connected of the set of biaccessible points in $J$ is zero except when $f(z)=z^2-2$ is the Chebyshev quadratic polynomial for which the corresponding measure is…

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…

We show that if $P$ is a quadratic polynomial with a fixed Cremer point and Julia set $J$, then for any monotone map $\ph:J\to A$ from $J$ onto a locally connected continuum $A$, $A$ is a single point.

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

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…

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.

According to the Thurston No Wandering Triangle Theorem, a branching point in a locally connected quadratic Julia set is either preperiodic or precritical. Blokh and Oversteegen proved that this theorem does not hold for higher degree Julia…

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 find an abundance of Cremer Julia sets of an arbitrarily high computational complexity.

It has been previously shown by two of the authors that some polynomial Julia sets are algorithmically impossible to draw with arbitrary magnification. On the other hand, for a large class of examples the problem of drawing a picture has…

The long-standing problem of existence of nowhere dense rational Julia set with positive area has been solved by an example in quadratic polynomials by Buff and Ch\'eritat. Since then many efforts have been devoted to finding out new…

For maps of one complex variable, $f$, given as the sum of a degree $n$ power map and a degree $d$ polynomial, we provide necessary and sufficient conditions that the geometric limit as $n$ approaches infinity of the set of points that…

Let $f(z) = z^2 + c$ be a quadratic polynomial, with c in the Mandelbrot set. Assume further that both fixed points of f are repelling, and that f is not renormalizable. Then we prove that the Julia set J of f is holomorphically removable…

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.

We show that repelling periodic points are landing points of periodic rays for exponential maps whose singular value has bounded orbit. For polynomials with connected Julia sets, this is a celebrated theorem by Douady, for which we present…

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…