Related papers: Non-accessible critical points of Cremer polynomia…

We prove that the only possible biaccessible points in the Julia set of a Cremer quadratic polynomial are the Cremer fixed point and its preimages. This gives a partial answer to a question posed by C. McMullen on whether such a Julia set…

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…

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…

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…

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…

We prove that if the multipliers of the repelling periodic orbits of a complex polynomial grow at least like $n^{5 + \epsilon}$, for some $\epsilon > 0$, then the Julia set of the polynomial is locally connected when it is connected. As a…

We show that computing even very coarse approximations of critical points is intractable for simple classes of nonconvex functions. More concretely, we prove that if there exists a polynomial-time algorithm that takes as input a polynomial…

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

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 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.

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 describe geometrically and algebraically the set of unattainable points for the Rational Hermite Interpolation Problem (i.e. those points where the problem does not have a solution). We show that this set is a union of equidimensional…

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

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 critical point degree of a periodic graph operator is the number of critical points of its complex Bloch variety. Determining it is a step towards the spectral edges conjecture and more generally understanding Bloch varieties. Previous…

We find an abundance of Cremer Julia sets of an arbitrarily high computational complexity.

For any polynomial map with a single critical point, we prove that its lower Lyapunov exponent at the critical value is negative if and only if the map has an attracting cycle. Similar statement holds for the exponential maps and some other…

In this paper, we obtain new results on the critical points of a polynomial, these results are useful to the Sendov conjecture.