arXiv · math/0507240
Combinatorial rigidity for unicritical polynomials
Abstract
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.
Explore related subjects
Keep this discovery
Artur Avila, Jeremy Kahn, Mikhail Lyubich, Weixiao Shen. 2005-07-12. Combinatorial rigidity for unicritical polynomials. https://arxiv.org/abs/math/0507240
Cite the original work for its findings. Save a collection to share your selection of sources.