Combinatorial Rigidity for Unicritical Polynomials
نویسنده
چکیده
We prove that any unicritical polynomial fc : z 7→ z+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 locally connected at the corresponding parameter values. It generalizes Yoccoz’s Theorem for quadratics to the higher degree case. Stony Brook IMS Preprint #2005/05 July 2005
منابع مشابه
Orbit Portraits of Unicritical Antiholomorphic Polynomials
Orbit portraits were introduced by Goldberg and Milnor as a combinatorial tool to describe the patterns of all periodic dynamical rays landing on a periodic cycle of a quadratic polynomial. This encodes information about the dynamics and the parameter spaces of these maps. We carry out a similar analysis for unicritical antiholomorphic polynomials, and give an explicit description of the orbit ...
متن کاملThe Dynamical André-oort Conjecture: Unicritical Polynomials
We establish the equidistribution with respect to the bifurcation measure of postcritically finite maps in any one-dimensional algebraic family of unicritical polynomials. Using this equidistribution result, together with a combinatorial analysis of certain algebraic correspondences on the complement of the Mandelbrot set M2 (or generalized Mandelbrot set Md for degree d > 2), we classify all c...
متن کاملRigidity for real polynomials
We prove the topological (or combinatorial) rigidity property for real polynomials with all critical points real and nondegenerate, which completes the last step in solving the density of Axiom A conjecture in real one-dimensional dynamics.
متن کاملMisiurewicz points for polynomial maps and transversality
The behavior under iteration of the critical points of a polynomial map plays an essential role in understanding its dynamics. We study the special case where the forward orbits of the critical points are finite. Thurston’s theorem tells us that fixing a particular critical point portrait and degree leads to only finitely many possible polynomials (up to equivalence) and that, in many cases, th...
متن کاملMulticorns are not path connected
The tricorn is the connectedness locus in the space of antiholomorphic quadratic polynomials z 7! z2 + c. We prove that the tricorn is not locally connected and not even pathwise connected, confirming an observation of John Milnor from 1992. We extend this discussion more generally for antiholomorphic unicritical polynomials of degrees d 2 and their connectedness loci, known as multicorns.
متن کامل