A combinatorial classification of postcritically fixed Newton maps
A combinatorial classification of postcritically fixed Newton maps
复制标题
DOI:
10.1017/etds.2018.2
复制
发表时间:
2007-01
影响因子:
0.9
通讯作者:
K. Drach;Yauhen Mikulich;Johannes Rückert;D. Schleicher
中科院分区:
文献类型:
--
作者:
K. Drach;Yauhen Mikulich;Johannes Rückert;D. Schleicher
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.