- Filled Julia set
The filled-in
Julia set of a polynomial is defined as the set of all points of dynamical plane that have bounded orbit with respect to
where :is set of complex numbers
is complex variable of function
is complex parameter of function:
may be various functions. In typical case iscomplex quadratic polynomial .
is the -fold compositions of with itself = iteration of function
Relation to the
Fatou set The filled-in Julia set is the (absolute) complement of attractive basin of infinity.
Attractive basin of infinity is one of components of the Fatou set.
In other words, the filled-in Julia set is the complement of the unbounded Fatou component:
Relation between Julia, filled-in Julia set and attractive basin of infinity
Julia set is common boundary of filled-in Julia set and attractive basin of infinity
where :
denotes attractive basin of infinity = exterior of filled-in Julia set = set of escaping points for
If filled-in Julia set has no interior thenJulia set coincides with filled-in Julia set. It happens when isMisiurewicz point .pine
Spine of the filled Julia set is defined as arc between -fixed point and ,
with such properities:
*spine lays inside [ [http://www.math.rochester.edu/u/faculty/doug/oldcourses/215s98/lecture10.html Douglas C. Ravenel : External angles in the Mandelbrot set: the work of Douady and Hubbard. University of Rochester] ] . This makes sense when is connected and full [ [http://www.emis.de/journals/EM/expmath/volumes/13/13.1/Milnor.pdf John Milnor : Pasting Together Julia Sets: A Worked Out Example of Mating. Experimental Mathematics Volume 13 (2004)] ]
*spine is invariant under 180 degree rotation,
* spine is a finite topological tree,
* Critical point always belongs to the spine. [ [http://arxiv.org/abs/math/9801148 Saaed Zakeri: Biaccessiblility in quadratic Julia sets I: The locally-connected case] ]
* -fixed point is a landing point ofexternal ray of angle zero ,
* is landing point ofexternal ray .Algorithms for constructiong the spine:
* is described by A. Douady [A. Douady, “Algorithms for computing angles in the Mandelbrot set,” in Chaotic Dynamics and Fractals, M. Barnsley and S. G. Demko, Eds., vol. 2 of Notes and Reports in Mathematics in Science and Engineering, pp. 155–168, Academic Press, Atlanta, Ga, USA, 1986.]*Simplified version of algorithm:
**connect and within by an arc,
**when has empty interior then arc is unique,
**otherwise take the shorest way that contains . [ [http://www.cambridge.org/catalogue/catalogue.asp?isbn=9780521547666 K M. Brucks, H Bruin : Topics from One-Dimensional Dynamics Series: London Mathematical Society Student Texts (No. 62) page 257] ]Curve :
divides dynamical plane into 2 components.
=References
# Peitgen Heinz-Otto, Richter, P.H. : The beauty of fractals: Images of Complex Dynamical Systems. Springer-Verlag 1986. ISBN 978-0387158518.
# Bodil Branner : Holomorphic dynamical systems in the complex plane. Department of Mathemathics Technical University of Denmark , [http://www2.mat.dtu.dk/publications/uk?id=122 MAT-Report no. 1996-42] .
Wikimedia Foundation. 2010.