arXiv · 1010.5280
A Combinatorial classification of postcritically fixed Newton maps
Abstract
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 ingredient is the proof that for every Newton map (postcritically finite or not) every connected component of the basin of an attracting fixed point can be connected to $\infty$ through a finite chain of such components.
Explore related subjects
Keep this discovery
Kostiantyn Drach, Yauhen Mikulich, Johannes Rückert, Dierk Schleicher. 2010-10-25. A Combinatorial classification of postcritically fixed Newton maps. https://doi.org/10.1017/etds.2018.2
Cite the original work for its findings. Save a collection to share your selection of sources.