Topological and Combinatorial Problems in One-dimensional Complex Dynamics
timetable:
Mon 14 Oct, 15:45 - 16:15, Aula Dini
<< Go back
A combinatorial characterization of postcritically finite Newton maps
speaker: Russell Lodge (Jacobs University)abstract: It will be shown that every postcritically finite Newton map gives rise to a finite graph containing all postcritical points called an extended Newton graph (together with a graph map). On the other hand, an extended Newton graph can be extended to a branch covering from the two-sphere to itself, and using Thurston's theorem it will be shown that this branch covering is equivalent to a Newton map. This is joint work with Y. Mikulich and D. Schleicher.
timetable:
Mon 14 Oct, 15:45 - 16:15, Aula Dini
<< Go back