Combinatorial rigidity for some infinitely renormalizable unicritical polynomials
Abstract
We prove combinatorial rigidity of infinitely renormalizable unicritical polynomials, Pc :z zd+c, with complex c, under the a priori bounds and a certain "combinatorial condition". This implies the local connectivity of the connectedness loci (the Mandelbrot set when d = 2) at the corresponding parameters.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.