Combinatorial rigidity for unicritical polynomials
classification
🧮 math.DS
keywords
unicriticalcasecombinatorialcombinatoriallyconnectedconnectednesscorrespondingdegree
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.