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

Buried Sierpinski curve Julia sets

Abstract: Abstract. In this paper we prove the existence of a new type of Sierpinski curve Julia set for certain families of rational maps of the complex plane. In these families, the complementary domains consist of open sets that are preimages of the basin at ∞ as well as preimages of other basins of attracting cycles.In recent years the families of rational maps of the complex plane given by z n + λ/z d have been shown to exhibit a rich array of both dynamical and topological phenomena. The principal focus of these s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2006
2006
2018
2018

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(12 citation statements)
references
References 8 publications
0
11
0
Order By: Relevance
“…In fact, there are infinitely many other copies of the Mandelbrot set in N (see [3]). In [6], the following was shown. This leads to another way that Sierpiński curves can occur as Julia sets in these families.…”
Section: Preliminariesmentioning
confidence: 94%
“…In fact, there are infinitely many other copies of the Mandelbrot set in N (see [3]). In [6], the following was shown. This leads to another way that Sierpiński curves can occur as Julia sets in these families.…”
Section: Preliminariesmentioning
confidence: 94%
“…For polynomial maps, it has been shown that the connectivity of a map's Julia set is tightly related to the structure of its critical orbits (i.e., the orbits of the map's critical points). Due to extensive work spanning almost one century, from Julia [8] and Fatou [9] until recent developments [10,11], we now have the following: For a single iterated logistic map [12,13], the Fatou-Julia Theorem implies that the Julia set is either totally connected, for values of c in the Mandelbrot set (i.e., if the orbit of the critical point 0 is bounded), or totally disconnected, for values of c outside of the Mandelbrot set (i.e., if the orbit of the critical point 0 is unbounded). In previous work, the authors showed that this dichotomy breaks in the case of random iterations of two maps [19].…”
Section: Networking Logistic Mapsmentioning
confidence: 99%
“…We begin by reviewing some basic properties of functions in this family. See [1] or [4] for proofs of these facts.…”
Section: Preliminariesmentioning
confidence: 99%