Connectivity of Julia sets of Newton maps

In this paper we give a unified proof of the fact that the Julia set of Newton's method applied to a holomorphic function of the complex plane (a polynomial of degree large than 1 or an entire transcendental function) is connected. The result was recently completed by the authors' previous...

Descripción completa

Detalles Bibliográficos
Autores: Barański, Krzysztof, Fagella, Núria|||0000-0002-5466-0579, Jarque i Ribera, Xavier|||0000-0002-6576-9780, Karpinska, Boguslawa
Tipo de recurso: artículo
Fecha de publicación:2018
País:España
Institución:Universitat Autònoma de Barcelona
Repositorio:Dipòsit Digital de Documents de la UAB
Idioma:inglés
OAI Identifier:oai:ddd.uab.cat:199328
Acceso en línea:https://ddd.uab.cat/record/199328
https://dx.doi.org/urn:doi:10.4171/RMI/1022
Access Level:acceso abierto
Palabra clave:Connectivity
Fatou set
Holomorphic dynamics
Julia set
Newton's map
Repelling fixed point
Simple connectivity
Descripción
Sumario:In this paper we give a unified proof of the fact that the Julia set of Newton's method applied to a holomorphic function of the complex plane (a polynomial of degree large than 1 or an entire transcendental function) is connected. The result was recently completed by the authors' previous work, as a consequence of a more general theorem whose proof spreads among many papers, which consider separately a number of particular cases for rational and transcendental maps, and use a variety of techniques. In this note we present a unified, direct and reasonably self-contained proof which works for all situations alike.