arXiv Analytics

Sign in

arXiv:math/0507240 [math.DS]AbstractReferencesReviewsResources

Combinatorial rigidity for unicritical polynomials

Artur Avila, Jeremy Kahn, Mikhail Lyubich, Weixiao Shen

Published 2005-07-12Version 1

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 locally connected at the corresponding parameter values. It generalizes Yoccoz's Theorem for quadratics to the higher degree case.

Related articles: Most relevant | Search more
arXiv:0712.3490 [math.DS] (Published 2007-12-20, updated 2010-03-02)
Combinatorial rigidity for some infinitely renormalizable unicritical polynomials
arXiv:1105.0497 [math.DS] (Published 2011-05-03)
Combinatorial rigidity of multicritical maps
arXiv:1411.6796 [math.DS] (Published 2014-11-25)
A note on repelling periodic points for meromorphic functions with bounded set of singular values