Related papers: Combinatorial properties of Newton maps
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials as dynamical systems. This lays the foundation for classification results of more general classes of Newton maps. A fundamental…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…
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…
We give a combinatorial classification of postsingularly finite exponential maps in terms of external addresses starting with the entry 0. This is an extension of the classification results for critically preperiodic polynomials \cite{BFH}…
We obtain a unique, canonical one-to-one correspondence between the space of marked postcritically finite Newton maps of polynomials and the space of postcritically minimal Newton maps of entire maps that take the form $p(z)…
In this paper we prove existence of matings between a large class of renormalizable cubic polynomials with one fixed critical point and another cubic polynomial having two fixed critical points. The resulting mating is a Newton map. Our…
The paper deals with Newton maps of complex exponential functions and a surgery tool developed by P. Ha\"issinsky. The concept of "Postcritically minimal" Newton maps of complex exponential functions are introduced, analogous to…
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 prove a formula for the multidegrees of a rational map defined by generalized monomials on a projective variety, in terms of integrals over an associated Newton region. This formula leads to an expression of the multidegrees as volumes…
A Latt\`es map $f\colon \hat{\mathbb{C}}\rightarrow \hat{\mathbb{C}}$ is a rational map that is obtained from a finite quotient of a conformal torus endomorphism. We characterize Latt\`es maps by their combinatorial expansion behavior.
We extend Thurston's combinatorial criterion for postcritically finite rational maps to a class of rational maps with bounded type Siegel disks. The combinatorial characterization of this class of Siegel rational maps plays a special role…
This note will describe an effective procedure for constructing critically finite real polynomial maps with specified combinatorics.
We introduce the notion of n-mating in this work, which includes the classical mating of polynomials as a special case. The new notion brings further links between the polynomial world and the rational world than the classical one, as well…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
We proved the so called complex bounds for multimodal, infinitely renormalizable analytic maps with bounded combinatorics: deep renormalizations have polynomial-like extensions with definite modulus. The complex bounds is the first step to…
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…
Some polynomials $P$ with rational coefficients give rise to well defined maps between cyclic groups, $\Z_q\longrightarrow\Z_r$, $x+q\Z\longmapsto P(x)+r\Z$. More generally, there are polynomials in several variables with tuples of rational…
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…
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…
In 1980's, Thurston established a combinatorial characterization for post-critically finite rational maps. This criterion was then extended by Cui, Jiang, and Sullivan to sub-hyperbolic rational maps. The goal of this paper is to present a…