Related papers: Recognizing topological polynomials by lifting tre…
We answer Hubbard's question on determining the Thurston equivalence class of ``twisted rabbits'', i.e. images of the ``rabbit'' polynomial under n-th powers of the Dehn twists about its ears. The answer is expressed in terms of the 4-adic…
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…
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…
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).
We solve an infinite family of twisted polynomial problems that are cubic generalizations of Hubbard's twisted rabbit problem. We show how the result of twisting by a power of a certain Dehn twist depends on the 9-adic expansion of the…
We solve generalizations of Hubbard's twisted rabbit problem for analogues of the rabbit polynomial of degree $d\geq 2$. The twisted rabbit problem asks: when a certain quadratic polynomial, called the Douady Rabbit polynomial, is twisted…
We extend the concept of a Hubbard tree, well established and useful in the theory of polynomial dynamics, to the dynamics of transcendental entire functions. We show that Hubbard trees in the strict traditional sense, as invariant compact…
A Thurston map is a branched covering map $f\colon S^2\to S^2$ that is postcritically finite. Mating of polynomials, introduced by Douady and Hubbard, is a method to geometrically combine the Julia sets of two polynomials (and their…
We use the theory of self-similar groups to enumerate all combinatorial classes of non-exceptional quadratic Thurston maps with fewer than five postcritical points. The enumeration relies on our computation that the corresponding maps on…
We study rational functions $f$ of degree $d+1$ such that $f$ is univalent in the exterior unit disc, and the image of the unit circle under $f$ has the maximal number of cusps ($d+1$) and double points $(d-2)$. We introduce a bi-angled…
Pilgrim's Finite Global Attractor Conjecture has been verified for polynomials [1], but remains open for general rational maps. In this paper, we prove the conjecture for a family of rational maps obtained by gluing two PCF polynomials…
Mating is an operation to construct a rational map f from two polynomials, which are not in conjugate limbs of the Mandelbrot set. When the Thurston Algorithm for the unmodified formal mating is iterated in the case of postcritical…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
In 1985, Levy used a theorem of Berstein to prove that all hyperbolic topological polynomials are equivalent to complex polynomials. We prove a partial converse to the Berstein-Levy Theorem: given post-critical dynamics that are in a sense…
We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…
The dynamical classification of rational maps is a central concern of holomorphic dynamics. Much progress has been made, especially on the classification of polynomials and some approachable one-parameter families of rational maps; the goal…
Topological mating is an combination that takes two same-degree polynomials and produces a new map with dynamics inherited from this initial pair. This process frequently yields a map that is Thurston-equivalent to a rational map $F$ on the…
We provide a complete combinatorial classification of critically fixed anti-Thurston maps, i.e., orientation-reversing branched covers of the 2-sphere that fix every critical point. The first step in the proof, and an interesting result in…
We study canonical decompositions of postcritically finite branched coverings of the 2-sphere, as defined by K. Pilgrim. We show that every hyperbolic cycle in the decomposition does not have a Thurston obstruction. It is thus Thurston…
A study of real quadratic maps with real critical points, emphasizing the effective construction of critically finite maps with specified combinatorics. We discuss the behavior of the Thurston algorithm in obstructed cases, and in one…