Combinatorial rigidity for unicritical polynomials

30Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

We prove that any unicritical polynomial fc : z → zd + C which is at most finitely renormalizable and has only repelling periodic points is combinatorially rigid. This implies that the connectedness locus (the "Multibrot set") is locally connected at the corresponding parameter values and generalizes Yoccoz's Theorem for quadratics to the higher degree case.

Cite

CITATION STYLE

APA

Avila, A., Kahn, J., Lyubich, M., & Shen, W. (2009). Combinatorial rigidity for unicritical polynomials. Annals of Mathematics, 170(2), 783–797. https://doi.org/10.4007/annals.2009.170.783

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free