|Date:||Tue, November 22, 2016|
|Place:||Research I Seminar Room|
Abstract: In the talk we will prove that for any Newton map every component of the basin of any attracting fixed point can be connected to infinity through the finite chain of such components. In particular, reducing to an attracting-critically-finite case, we will show that all the polls can be connected to infinity by a finite graph defined via a so-called channel diagram. The talk is based on the paper "A combinatorial classification of postcritically fixed Newton maps" by Y. Mikulich, J. Rueckert, and D. Schleicher.