2016
DOI: 10.3934/dcds.2016079
|View full text |Cite
|
Sign up to set email alerts
|

Backward iteration algorithms for Julia sets of Möbius semigroups

Abstract: We extend a result regarding the Random Backward Iteration algorithm for drawing Julia sets (known to work for certain rational semigroups containing a non-Möbius element) to a class of Möbius semigroups which includes certain settings not yet been dealt with in the literature, namely, when the Julia set is not a thick attractor in the sense given in [8].

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

1
0
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 25 publications
1
0
0
Order By: Relevance
“…This variety of Julia sets is easier to grasp, if one looks at them as corresponding to the topological semigroup generated by infinite compact families of proper polynomial mappings. This is consistent with the point of view adopted by a number of researchers in one complex variable (see [2] and, e.g., the work of Stankewitz and Sumi [3][4][5]).…”
Section: Introductionsupporting
confidence: 90%
“…This variety of Julia sets is easier to grasp, if one looks at them as corresponding to the topological semigroup generated by infinite compact families of proper polynomial mappings. This is consistent with the point of view adopted by a number of researchers in one complex variable (see [2] and, e.g., the work of Stankewitz and Sumi [3][4][5]).…”
Section: Introductionsupporting
confidence: 90%