On the Partition of Fast Escaping Sets of a Transcendental Entire Function
DOI:
https://doi.org/10.3126/jist.v27i1.46683Keywords:
Escaping set, fast escaping set, maximally fast escaping set, non-maximally fast escaping setAbstract
For a transcendental entire function f, the set of form I ( f ) = {z ∈ : (z) → ∞ as n → ∞} is called an escaping set. The major open question in transcendental dynamics is the conjecture of Eremenko, which states that for any transcendental entire function f, the escaping set I ( f ) has no bounded component. This conjecture in a special case has been proved by defining the fast escaping set A ( f ), which consists of points that move to infinity as fast as possible. Very recent studies in the field of transcendental dynamics have concentrated on the partition of fast escaping sets into maximally and non-maximally fast escaping sets. It is well known that a fast escaping set has no bounded component, but in contrast, there are entire transcendental functions for which each maximally and non-maximally fast escaping set has uncountably many singleton components.
Downloads
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 Institute of Science and Technology, T.U.
![Creative Commons License](http://i.creativecommons.org/l/by-sa/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
The views and interpretations in this journal are those of the author(s). They are not attributable to the Institute of Science and Technology, T.U. and do not imply the expression of any opinion concerning the legal status of any country, territory, city, area of its authorities, or concerning the delimitation of its frontiers of boundaries.
The copyright of the articles is held by the Institute of Science and Technology, T.U.