Related papers: MLC at Feigenbaum points

In this paper we prove a priori bounds for an ``elephant eye'' combinatorics. Little $M$-copies specifying these combinatorics are allowed to converge to the cusp of the Mandelbrot set. To handle it, we develope a new geometric tool:…

Let $f_c(z) = z^2+c$ for $c \in \mathbb{C}$. We show there exists a uniform bound on the number of points in $\mathbb{P}^1(\mathbb{C})$ that can be preperiodic for both $f_{c_1}$ and $f_{c_2}$ with $c_1\not= c_2$ in $\mathbb{C}$. The proof…

We describe a primary limb structure in the connectedness locus of complex cubic polynomials, where the limbs are indexed by the periodic points of the doubling map $t \mapsto 2t \ (\operatorname{mod} {\mathbb Z})$. The main renormalization…

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…

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…

We introduce a collection of polynomials $F_N$, associated to each positive integer $N$, whose divisibility properties yield a reformulation of the Goldbach conjecture. While this reformulation certainly does not lead to a resolution of the…

Given a global field K and a polynomial f defined over K of degree at least two, Morton and Silverman conjectured in 1994 that the number of K-rational preperiodic points of f is bounded in terms of only the degree of K and the degree of f.…

We establish universality of local eigenvalue correlations in unitary random matrix ensembles (1/Z_n) |\det M|^{2\alpha} e^{-n\tr V(M)} dM near the origin of the spectrum. If V is even, and if the recurrence coefficients of the orthogonal…

We show the hyperbolicity of the Feigenbaum fixed point using the inflexibility of the Feigenbaum tower, the Man\~e-Sad-Sullivan $\lambda$-Lemma and the existence of parabolic domains (petals) for semi-attractive fixed points.

Let f(z)=z^2+c be an infinitely renormalizable quadratic polynomial and J_\infty be the intersection of forward orbits of "small" Julia sets of its simple renormalizations. We prove that if f admits an infinite sequence of satellite…

We use the methods developed with M. Lyubich for proving complex bounds for real quadratics to extend E. De Faria's complex a priori bounds to all critical circle maps with an irrational rotation number. The contracting property for…

We consider fixed points of the Feigenbaum (periodic-doubling) operator whose orders tend to infinity. It is known that the hyperbolic dimension of their Julia sets go to 2. We prove that the Lebesgue measure of these Julia sets tend to…

We prove uniform hyperbolicity of the renormalization operator for all possible real combinatorial types. We derive from it that the set of infinitely renormalizable parameter values in the real quadratic family $P_c: x\mapsto x^2+c$ has…

Let $f_0$ be a polynomial of degree $d_1+d_2$ with a periodic critical point $0$ of multiplicity $d_1-1$ and a Julia critical point of multiplicity $d_2$. We show that if $f_0$ is primitive, free of neutral periodic points and…

The so-called "pinched disk" model of the Mandelbrot set is due to A.~Douady, J.~H.~Hubbard and W.~P.~Thurston. It can be described in the language of geodesic laminations. The combinatorial model is the quotient space of the unit disk…

In this short note, we give a sketch of a new proof of the exponential contraction of the Feigenbaum renormalization operator in the hybrid class of the Feigenbaum fixed point. The proof uses the non existence of invariant line fields in…

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.

We prove that a long iteration of rational maps is expanding near boundaries of bounded type Siegel disks. This leads us to extend Petersen's local connectivity result on the Julia sets of quadratic Siegel polynomials to a general case. A…

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…