Annular itineraries for entire functions

Rippon, P. J. and Stallard, G. M. (2015). Annular itineraries for entire functions. Transactions of the American Mathematical Society, 367(1) pp. 377–399.

DOI: https://doi.org/10.1090/S0002-9947-2014-06354-X

Abstract

In order to analyse the way in which the size of the iterates of a transcendental entire function f can behave, we introduce the concept of the annular itinerary of a point z. This is the sequence of non-negative integers s₀s₁ . . . defined by

fⁿ(z) ∈ A_sn(R), for n ≥ 0,

where A₀(R) = {z : |z| < R} and

A_n(R) = {z : Mⁿ⁻¹(R) ≤ |z|<Mⁿ(R)}, n≥ 1.

Here M(r) is the maximum modulus of f on {z : |z| = r} and R > 0 is so large that M(r) > r, for r ≥ R.

We consider the different types of annular itineraries that can occur for any transcendental entire function f 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.

Viewing alternatives

Metrics

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI

About

• Item ORO ID
• 40671
• Item Type
• Journal Item
• ISSN
• 1088-6850
• Project Funding Details

• Funded Project Name	Project ID	Funding Body
  Baker's conjecture and Eremenko's conjecture: a unified approach.	EP/H006591/1	EPSRC (Engineering and Physical Sciences Research Council)

• Academic Unit or School
• Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
  Faculty of Science, Technology, Engineering and Mathematics (STEM)
• Copyright Holders
• © 2014 American Mathematical Society
• Depositing User
• Philip Rippon