2012
DOI: 10.1007/s11856-012-0033-0
|View full text |Cite
|
Sign up to set email alerts
|

On the packing dimension of the Julia set and the escaping set of an entire function

Abstract: Abstract. Let f be a transcendental entire function. We give conditions which imply that the Julia set and the escaping set of f have packing dimension 2. For example, this holds if there exists a positive constant c less than 1 such that the minimum modulus L(r, f ) and the maximum modulus M (r, f ) satisfy log L(r, f ) ≤ c log M (r, f ) for large r. The conditions are also satisfied if log M (2r, f ) ≥ d log M (r, f ) for some constant d greater than 1 and all large r.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
16
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 8 publications
(17 citation statements)
references
References 36 publications
1
16
0
Order By: Relevance
“…Remark A similar condition to (5.1) appears in a recent paper of Bergweiler [3]. The main result of [3] is that if f is a transcendental entire function with no multiply connected Fatou components and The assertion that (5.13) implies that f has no multiply connected Fatou components is justified in [3] by using results from either [25] or [6], and the assertion that (5.13) implies (5.12) is deduced from a result of Fenton [11]. We remark that this latter implication can also be deduced by using the argument from the proof of Theorem 5.…”
Section: Sufficient Conditions For Log-regularitysupporting
confidence: 63%
See 1 more Smart Citation
“…Remark A similar condition to (5.1) appears in a recent paper of Bergweiler [3]. The main result of [3] is that if f is a transcendental entire function with no multiply connected Fatou components and The assertion that (5.13) implies that f has no multiply connected Fatou components is justified in [3] by using results from either [25] or [6], and the assertion that (5.13) implies (5.12) is deduced from a result of Fenton [11]. We remark that this latter implication can also be deduced by using the argument from the proof of Theorem 5.…”
Section: Sufficient Conditions For Log-regularitysupporting
confidence: 63%
“…Finally we mention two other regularity conditions. First, the condition log M(2r) ≥ d log M(r), for large r, where d > 1, was mentioned in [3] in relation to a result on the packing dimension of I(f ) ∩ J(f ); see the remark after the proof of Theorem 5.1 of this paper. This regularity condition is easily seen to imply log-regularity.…”
Section: Now We Deduce Theorem 41mentioning
confidence: 99%
“…(a) If m ∈ N and ε ∈ (π/ log r n , (b n − a n )/2), where n ∈ N is sufficiently large, then Another application of Theorem 5.1(a) is given in [13,Corollary 4.1]. The next result states that, for large n ∈ N, the iterates of f behave like monomials inside C n .…”
Section: Dynamics In a Multiply Connected Wandering Domainmentioning
confidence: 98%
“…This may be possible by replacing the use of the degree two Chebyshev polynomial in the paper [6] by higher degree Chebyshev polynomials or generalized Chebyshev polynomials. Can we use such constructions to show the conditions in Bergweiler's paper [4] implying Pdim(J ) = 2 are sharp?…”
Section: Preliminarymentioning
confidence: 99%
“…In [4], a criteria on the calculation of packing dimension was given: If F (f ) has no multiply connected component, then…”
Section: Preliminarymentioning
confidence: 99%