Permutable entire functions and multiply connected wandering domains (Q895548): Difference between revisions

Two functions \(f\) and \(g\) are called permutable if \(f\circ g = g\circ f\). Fatou and Julia used the iteration theory of rational functions to classify permutable polynomials and, more generally, permutable rational functions for which the Fatou set is not empty. One important step in their arguments was to show that permutable rational functions have the same Julia set. For transcendental entire functions this is still unknown. It is known that this holds if the functions have no wandering domains. Here, the authors use new methods in order to deal with the case of the functions having multiply connected wandering domains. So, the only case that remains open are (fast escaping) simply connected wandering domains; that is, the Julia sets of two permutable entire functions are equal if there are no such domains.