Spelling suggestions: "subject:"holomorfa"" "subject:"holomorfo""
1 |
Connectivity of Julia sets of transcendental meromorphic functionsTaixés i Ventosa, Jordi 22 September 2011 (has links)
Newton's method associated to a complex holomorphic function f is defined by the dynamical system Nf(z) = z – f(z) / f'(z). As a root-finding algorithm, a natural question is to understand the dynamics of Nf about its fixed points, as they correspond to the roots of the function f. In other words, we would like to understand the basins of attraction of Nf, i.e., the sets of points that converge to a root of f under the iteration of Nf.
Basins of attraction are actually just one type of stable component or component of the Fatou set, defined as the set of points for which the family of iterates is defined and normal locally. The Julia set or set of chaos is its complement (taken on the Riemann sphere).
The study of the topology of these two sets is key in Holomorphic Dynamics. In 1990, Mitsuhiro Shishikura proved that, for any non-constant polynomial P, the Julia set of NP is connected. In fact, he obtained this result as a consequence of a much more general theorem for rational functions: If the Julia set of a rational function R is disconnected, then R has at least two weakly repelling fixed points.
With the final goal of proving the transcendental version of this theorem, in this Thesis we see that: If a transcendental meromorphic function f has either a multiply-connected attractive basin, or a multiply-connected parabolic basin, or a multiply-connected Fatou component with simply-connected image, then f has at least one weakly repelling fixed point.
Our proof for this result is mainly based in two techniques: quasiconformal surgery and the study of the existence of virtually repelling fixed points.
We conclude the Thesis with an idea of the strategy for the proof of the case of Herman rings, as well as some ideas for the case of Baker domains, which is left as a subject for a future project.
|
Page generated in 0.0258 seconds