| Infinitely renormalizable quadratic polynomials have been heavily studied. In the context of quadratic-like renormalization, one may try to prove the existence of a priori bounds, a definite thickness for the annuli corresponding to the renormalizations. In 1997, M. Lyubich showed that a priori bounds imply local connectivity of the Julia set and combinatorial rigidity for the corresponding quadratic polynomial. In a paper from 2006, J. Kahn showed that infinitely renormalizable quadratic polynomials of bounded primitive type admit a priori bounds. In 2002, H. Inou generalized some of the polynomial-like renormalization theory to polynomials of higher degree with several critical points. In my thesis, I generalize Kahn's theorem to the context of polynomials of higher degree admitting infinitely many primitive renormalizations of bounded type around each of their critical points. These a priori bounds imply local connectivity and rigidity. |
