It is well known that the Hubbard tree of a postcritically finite complex polynomial contains all the combinatorial information on the polynomial. In fact, an abstract Hubbard tree as defined in  uniquely determines the polynomial up to affine conjugation. In this paper we give necessary and sufficient conditions enabling one to deduce directly from the restriction of a quadratic Misiurewicz polynomial to its Hubbard tree whether the polynomial is renormalizable, and in this case, of which type. Moreover, we study dynamical features such as entropy, transitivity or periodic structure of the polynomial restricted to the Hubbard tree, and compare them with the properties of the polynomial on its Julia set. In other words, we want to study how much of the "dynamical information" about the polynomial is captured by the Hubbard tree.
|Publication status||Published - 1 Dec 2000|
- Hubbard trees
- Misiurewicz polynomials
- Topological entropy