Related papers: Combinatorial rigidity for some infinitely renorma…

We prove that any unicritical polynomial $f_c:z\mapsto z^d+c$ which is at most finitely renormalizable and has only repelling periodic points is combinatorially rigid. It implies that the connectedness locus (the ``Multibrot set'') is…

A while ago MLC (the conjecture that the Mandelbrot set is locally connected) was proven for quasi-hyperbolic points by Douady and Hubbard, and for boundaries of hyperbolic components by Yoccoz. More recently Yoccoz proved MLC for all at…

This is a continuation of the series of notes on the dynamics of quadratic polynomials. We show the following Rigidity Theorem: Any combinatorial class contains at most one quadratic polynomial satisfying the secondary limbs condition with…

We prove the a priori bounds for infinitely renormalizable quadratic polynomials for which we can find an infinite sequence of primitive renormalizations such that the ratios of the periods of successive renormalizations is bounded. This…

For an infinitely renormalizable quadratic map $f_c: z\mapsto z^2+c$ with the sequence of renormalization periods ${k_m}$ and rotation numbers ${t_m=p_m/q_m}, we prove that if $\limsup k_m^{-1}\log |p_m|>0$, then the Mandelbrot set is…

We prove that the Julia set $J(f)$ of at most finitely renormalizable unicritical polynomial $f:z\mapsto z^d+c$ with all periodic points repelling is locally connected. (For $d=2$ it was proved by Yoccoz around 1990.) It follows from a…

We prove a priori bounds for Feigenbaum quadratic polynomials, i.e., infinitely renormalizable polynomials $f_c: z\mapsto z^2+c$ of bounded type. It implies local connectivity of the corresponding Julia sets $J(f_c)$ and MLC (local…

We give an arithmetic proof of rigidity for postcritically finite polynomials.

In this paper we describe the well studied process of renormalization of quadratic polynomials from the point of view of their natural extensions. In particular, we describe the topology of the inverse limit of infinitely renormalizable…

A decoration of the Mandelbrot set $M$ is a part of $M$ cut off by two external rays landing at some tip of a satellite copy of $M$ attached to the main cardioid. In this paper we consider infinitely renormalizable quadratic polynomials…

We show that every polynomial of degree $d \geq 2$ in the connectedness locus with an attracting cycle which attracts at least two critical points and no indifferent cycles is not combinatorially rigid. In particular, we prove that a…

In this paper we prove {\it a priori bounds} for infinitely renormalizable quadratic polynomials satisfying a ``molecule condition''. Roughly speaking, this condition ensures that the renormalization combinatorics stay away from the…

We prove that topologically conjugate non-renormalizable polynomials are quasi-conformally conjugate. From this we derive that each such polynomial can be approximated by a hyperbolic polynomial. As a by product we prove that the Julia set…

We consider infinitely renormalizable Lorenz maps with real critical exponent $\alpha>1$ and combinatorial type which is monotone and satisfies a long return condition. For these combinatorial types we prove the existence of periodic points…

We construct a subset of the Mandelbrot set which is dense on the boundary of the Mandelbrot set and which consists of only infinitely renormalizable points such that the Mandelbrot set is locally connected at every point of this subset. We…

In this Note, we present recent developments in the Renormalization Theory of quadratic polynomials and discuss their applications, with an emphasis on the MLC conjecture, the problem of local connectivity of the Mandelbrot set, and on its…

For the study of the 2-dimensional space of cubic polynomials, J. Milnor considers the complex 1-dimensional slice S_n of the cubic polynomials which have a super-attracting orbit of period n. He gives in [M4] a detailed conjectural picture…

We study the bifurcation loci of quadratic (and unicritical) polynomials and exponential maps. We outline a proof that the exponential bifurcation locus is connected; this is an analog to Douady and Hubbard's celebrated theorem that (the…

A simplicial polytope is combinatorially rigid if its combinatorial structure is determined by its graded Betti numbers which are important invariant coming from combinatorial commutative algebra. We find a necessary condition to be…

Let f be a degree d polynomial defined over the nonarchimedean field C_p, normalized so f is monic and f(0)=0. We say f is post-critically bounded, or PCB, if all of its critical points have bounded orbit under iteration of f. It is known…