Related papers: Newton maps of complex exponential functions and p…
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)…
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…
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…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
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…
Renormalizations can be considered as building blocks of complex dynamical systems. This phenomenon has been widely studied for iterations of polynomials of one complex variable. Concerning non-polynomial hyperbolic rational maps, a recent…
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…
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…
This paper proposes and develops a new Newton-type algorithm to solve subdifferential inclusions defined by subgradients of extended-real-valued prox-regular functions. The proposed algorithm is formulated in terms of the second-order…
We study eigenvalues along periodic cycles of post-critically finite endomorphisms of $\mathbb{CP}^n$ in higher dimension. It is a classical result when $n = 1$ that those values are either $0$ or of modulus strictly bigger than $1$. It has…
Inou and Shishikura provided a class of maps that is invariant by near-parabolic renormalization, and that has proved extremely useful in the study of the dynamics of quadratic polynomials. We provide here another construction, using more…
In this paper, we define the core entropy for postcritically-finite Newton maps and study its continuity within this family. We show that the entropy function is not continuous in this family, which is different from the polynomial case…
Contents: 1. Quasiconformal Surgery and Deformations: Ben Bielefeld, Questions in quasiconformal surgery; Curt McMullen, Rational maps and Teichm\"uller space; John Milnor, Thurston's algorithm without critical finiteness; Mary Rees, A…
This article is meant as a mathematical appendix or comment on [BT]. We first consider the notion of transcritical bifurcations of fixed points of general area-preserving maps, and then adress some questions related to [BT] on bifurcation…
Some results of B. Pasynkov and H. Torunczyk on finite-dimensional maps are improved. A generalization of a Dranishnikov-Uspenskij theorem about extensional dimension is also obtained.
In this paper, we construct geometrically finite rational maps with buried critical points on the boundaries of some hyperbolic components by using the pinching and plumbing deformations.
We extend the work of Bielefeld, Fisher and Hubbard on Critical Portraits to the case of arbitrary postcritically finite polynomials. This determines an effective classification of postcritically finite polynomials as dynamical systems.…
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…
Normals with unknown parameters (NUP) can be used to convert nontrivial model-based estimation problems into iterations of linear least-squares or Gaussian estimation problems. In this paper, we extend this approach by augmenting factor…
Given any postsingularly finite exponential function $p_\lambda(z) = \lambda \exp(z)$ where $\lambda \in \C^*$, we construct a sequence of postcritically finite unicritical polynomials $p_{d,\lambda_d}(z) = \lambda_d(1+\frac{z}{d})^d$ that…