A Classification of Postcritically Finite Newton Maps
DOI10.1007/978-3-030-97560-9_13OpenAlexW1903365917MaRDI QIDQ5055449
Russell Lodge, Yauhen Mikulich, Dierk Schleicher
Publication date: 13 December 2022
Published in: In the Tradition of Thurston II (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.02771
renormalizationparameter spacerational mapHubbard treeNewton mapcombinatorial classificationThurston's theoremextended Newton graph
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)
Related Items (16)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proof of Thurston's topological characterization of rational functions
- Twisted matings and equipotential gluings
- Finding polynomial roots by dynamical systems -- a case study
- Newton's method in practice: finding all roots of polynomials of degree one million efficiently
- Hubbard trees
- The Classification of Critically Preperiodic Polynomials as Dynamical Systems
- Combining rational maps and controlling obstructions
- Combinatorial properties of Newton maps
- A characterization of postcritically minimal Newton maps of complex exponential functions
- A combinatorial classification of postcritically fixed Newton maps
- On the classification of critically fixed rational maps
- Dynamics in One Complex Variable. (AM-160)
- Puzzles and the Fatou–Shishikura injection for rational Newton maps
- How to find all roots of complex polynomials by Newton's method.
This page was built for publication: A Classification of Postcritically Finite Newton Maps