Related papers: The critical orbit structure of quadratic polynomi…

We construct combinatorial Hubbard trees for all unicritical polynomials, and for all exponential maps, for which the critical (singular) value does not escape. More precisely, out of an external angle, or more generally a kneading…

Hubbard trees are invariant trees connecting the points of the critical orbits of postcritically finite polynomials. Douady and Hubbard \cite{Orsay} introduced these trees and showed that they encode the essential information of Julia sets…

The multiplier $\lambda_n$ of a periodic orbit of period $n$ can be viewed as a (multiple-valued) algebraic function on the space of all complex quadratic polynomials $p_c(z)=z^2+c$. We provide a numerical algorithm for computing critical…

Answering a question posed by Adam Epstein, we show that the collection of conjugacy classes of polynomials admitting a parabolic fixed point and at most one infinite critical orbit is a set of bounded height in the relevant moduli space.…

We establish necessary and sufficient conditions for the realization of mapping schemata as post-critically finite polynomials, or more generally, as post-critically finite polynomial maps from a finite union of copies of the complex…

We provide an effective classification of postcritically finite polynomials as dynamical systems by means of Hubbard Trees. This can be viewed as an application of the results developed in part 1 (Stony Brook IMS 1993/5).

The behavior under iteration of the critical points of polynomial maps plays an essential role in understanding its dynamics. We study the special case where the forward orbits of the critical points are finite. Thurston's theorem tells us…

In this paper, we study the critical orbit of a post-critically finite polynomial of the form $f_{c,d}(x) = x^d+c \in \mathbb{C}[x]$. We discover that in many cases the orbit elements satisfy some strong arithmetic properties. It is well…

We consider semigroup dynamical systems defined by several polynomials over a number field $\mathbb{K}$, and the orbit (tree) they generate at a given point. We obtain finiteness results for the set of preperiodic points of such systems…

The theory of Hubbard trees provides an effective classification of non-linear post-critically finite polynomial maps from \C to itself. This note will extend this classification to the case of maps from a finite union of copies of \C to…

Let $L$ be a field of positive characteristic $p$ with a fixed algebraic closure $\overline{L}$, and let $\alpha_1,\alpha_2,\beta\in L$. For an integer $d\ge 2$, we consider the family of polynomials $f_{\lambda}(z) := z^d+\lambda$,…

Let f be a degree d polynomial defined over the nonarchimedean field C_p, normalized so f is monic and f(0)=0. We say f is post-critically bounded, or PCB, if all of its critical points have bounded orbit under iteration of f. It is known…

We use the Weil bound of multiplicative character sums together with some recent results of N. Boston and R. Jones, to show that the critical orbit of quadratic polynomials over a finite field of $q$ elements is of length $O(q^{3/4})$,…

Iteration of the quadratic map produces sequences of polynomials whose degrees {\sl explode} as the orbital period grows more and more. The polynomial mixing all 335 period-12 orbits has degree $4020$, while for the $52,377$ period-20…

As a particular problem within the field of non-autonomous discrete systems, we consider iterations of two quadratic maps $f_{c_0}=z^2+c_0$ and $f_{c_1}=z^2+c_1$, according to a prescribed binary sequence, which we call a \emph{template}.…

We give a simple algorithm that determines whether a given post-critically finite topological polynomial is Thurston equivalent to a polynomial. If it is, the algorithm produces the Hubbard tree; otherwise, the algorithm produces the…

It is well known that the dynamical behavior of a rational map $f:\widehat{\mathbb C}\to \widehat{\mathbb C}$ is governed by the forward orbits of the critical points of $f$. The map $f$ is said to be postcritically finite if every critical…

Fix a prime number $d$. The post-critically finite polynomials of the form $f_{d,c} = x^d+c\in \mathbb{C}[x]$ play a fundamental role in polynomial dynamics. While many results are known in the complex dynamical setting, much less is…

Fix a rational basepoint b and a rational number c. For the quadratic dynamical system f_c(x) = x^2+c, it has been shown that the number of rational points in the backward orbit of b is bounded independent of the choice of rational…

We consider cubic polynomials f(z)=z^3+az+b defined over the function field C(L), with a marked point of period N and multiplier L. In the case N=1, there are infinitely many such objects, and in the case N>2, only finitely many. The case…