The iterated minimum modulus and conjectures of Baker and Eremenko (Q2299599)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    The iterated minimum modulus and conjectures of Baker and Eremenko
    scientific article

      Statements

      The iterated minimum modulus and conjectures of Baker and Eremenko (English)
      0 references
      0 references
      0 references
      0 references
      21 February 2020
      0 references
      Let \(f\) be a transcendental entire function and let \(m(r)=\min_{|z|=r}|f(z)|\) be the minimum modulus of \(f\). Let \(m^n(r)\) be the \(n\)-th iterate of \(m(r)\). The authors consider functions for which which there exists \(r>0\) such that \(m^n(r)\to\infty\). They show that this condition holds for large classes of functions. For example, this is the case for functions of order less than \(1/2\), for function with Fabry gaps, or functions with multiply connected wandering domains. Next the authors relate this condition to conjectures of Eremenko and Baker, saying that all components of the escaping set of an entire function are unbounded, and that the Fatou set of an entire function of order less than \(1/2\) has no bounded components. They show that the conclusion of these conjectures holds if \(f\) satisfies the above condition on the iterated minimum modulus and suitable additional hypotheses. They also show that certain sets occurring in this study are \textit{spiders' webs}.
      0 references
      Julia set
      0 references
      Fatou set
      0 references
      escaping set
      0 references
      minimum modulus
      0 references
      Baker's conjecture
      0 references
      Eremenko's conjecture
      0 references
      spider's web
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references