A classification of postcritically finite Newton maps

DOI10.1007/978-3-030-97560-9_13MaRDI QIDQ6266263arXivFDO

Authors Russell Lodge, Yauhen Mikulich, Dierk Schleicher

Publication date 9 October 2015

Published in arXiv

Full work available at URL https://doi.org/10.1007/978-3-030-97560-9_13

Mathematics Subject Classification ID

Functional equations in the complex plane, iteration and composition of analytic functions of one complex variable (30D05) Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Combinatorics and topology in relation with holomorphic dynamical systems (37F20)

arXiv classification

math.DS

Abstract: 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 of finding a classification of general rational maps is so far elusive. Newton maps (rational maps that arise when applying Newton's method to a polynomial) form a most natural family to be studied from the dynamical perspective. Using Thurston's characterization and rigidity theorem, a complete combinatorial classification of postcritically finite Newton maps is given in terms of a finite connected graph satisfying certain explicit conditions.

This page was built for publication: A classification of postcritically finite Newton maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6266263)