English

Annular itineraries for entire functions

Dynamical Systems 2013-01-08 v1 Complex Variables

Abstract

In order to analyse the way in which the size of the iterates (fn(z))(f^n(z)) of a transcendental entire function ff can behave, we introduce the concept of the {\it annular itinerary} of a point zz. This is the sequence of non-negative integers s0s1...s_0s_1... defined by fn(z)Asn(R),    forn0, f^n(z)\in A_{s_n}(R),\;\;\text{for}n\ge 0, where A0(R)={z:z<R}A_0(R)=\{z:|z|<R\} and An(R)={z:Mn1(R)z<Mn(R)},    n1. A_n(R)=\{z:M^{n-1}(R)\le |z|<M^n(R)\},\;\;n\ge 1. Here M(r)M(r) is the maximum modulus of ff and R>0R>0 is so large that M(r)>rM(r)>r, for rRr\ge R. We consider the different types of annular itineraries that can occur for any transcendental entire function ff and show that it is always possible to find points with various types of prescribed annular itineraries. The proofs use two new annuli covering results that are of wider interest.

Cite

@article{arxiv.1301.1328,
  title  = {Annular itineraries for entire functions},
  author = {Philip J. Rippon and Gwyneth M. Stallard},
  journal= {arXiv preprint arXiv:1301.1328},
  year   = {2013}
}
R2 v1 2026-06-21T23:05:19.464Z