Fractals/Iterations in the complex plane/def cqp

Definitions 

Order is not only alphabetical but also by topic so use find ( Ctrl-f)

=Address=

"Internal addresses encode kneading sequences in human-readable form, when extended to angled internal addresses they distinguish hyperbolic components in a concise and meaningful way. The algorithms are mostly based on Dierk Schleicher's paper Internal Addresses Of The Mandelbrot Set And Galois Groups Of Polynomials (version of February 5, 2008) http://arxiv.org/abs/math/9411238v2." Claude Heiland-Allen

types
 * finite / infinite
 * accesible/non-accesible
 * on the parameter plane / on th edynamic plane
 * simple/ angled
 * for Crossed Renormalizations

Internal
Internal addresses describe the combinatorial structure of the Mandelbrot set.

$$ 1 \quad \xrightarrow \quad\ 3 \quad \xrightarrow \quad\  6$$

Internal address :
 * is not constant within hyperbolic component. Example : internal address of -1 is 1->2 and internal address of 0.9999 is 1
 * of hyperbolic component is defined as a internal address of it's center

angled
Angled internal address is an extension of internal address

$$ 1 \quad \xrightarrow{1/3}\ 3 \quad \xrightarrow{1/2}\  6$$

This address describes period 6 component which is a satelite of period 3 component.

Problems

 * islands
 * infinite sequence of bifurcations

=Angle=

Types of angle


where :
 * $$\rho_n(c)$$ is a multiplier map
 * $$ \Phi(c) \,$$ is a Boettcher function

external
The external angle is a angle of
 * point of set's exterior
 * the boundary.

It is :
 * the same on all points on the external ray. It is important for proving connectedness of the Mandelbrot set.
 * a proper fraction

internal
The internal angle is an angle of point of component's interior
 * it is a rational number and proper fraction measured in turns
 * it is the same for all point on the internal ray
 * in a contact point ( root point ) it agrees with the rotation number
 * root point has internal angle 0 ( inside child component)
 * "The internal angles start at 0, at the cusp, and increase counterclockwise. " Robert Munafo

$$\alpha = \frac{p}{q} \in \mathbb{Q}$$

plain
The plain angle is an angle of complex point = it's argument

Units

 * turns
 * degrees
 * radians

Number types
Angle ( for example external angle in turns ) can be used in different number types

Examples :

the external arguments of the rays landing at z = −0.15255 + 1.03294i are :

$$(\theta^- _{20}, \theta^+_{20} ) = (0.\overline{00110011001100110100}, 0.\overline{00110011001101000011})$$

where :

$$\theta^- _{20} = 0.\overline{00110011001100110100}_2 = 0.\overline{20000095367522590181913549340772}_{10} = \frac{209716}{1048575} = \frac{209716}{2^{20}-1}$$ =Bifurcation= =Coordinate= Coordinate :
 * Numerical Bifurcation Analysis of Maps
 * MatCont
 * Fatou coordinate for every repelling and attracting petal ( linearization of function near parabolic fixed point )
 * Boettcher
 * Koenigs

"The coordinates are the current location, measured on the x-y-z axis. The gradient is a direction to move from our current location" Sadid Hasan

=Curves= Types:
 * topology:
 * closed versus open
 * simple versus not simple
 * other properities:
 * invariant
 * critical

Description
 * plane curve = it lies in a plane.
 * closed = it starts and ends at the same place.
 * simple = it never crosses itself.

closed
Closed curves are curves whose ends are joined. Closed curves do not have end points.
 * Simple Closed Curve : A connected curve that does not cross itself and ends at the same point where it begins. It divides the plane into exactly two regions ( Jordan curve theorem ). Examples of simple closed curves are ellipse, circle and polygons.
 * complex Closed Curve ( not simple = non-simple ) It divides the plane into more than two regions.  Example :  Lemniscates.

"non-self-intersecting continuous closed curve in plane" = "image of a continuous injective function from the circle to the plane"

Unit circle
Unit circle $$\partial D\,$$ is a boundary of unit disk $$\partial D = \left\{ w: abs(w)=1 \right \}$$

where coordinates of $$w\,$$ point of unit circle in exponential form are :

$$w = e^{i*t}\,$$

Critical curves
Diagrams of critical polynomials are called critical curves.

These curves create skeleton of bifurcation diagram. (the dark lines )

dendrit

 * a locally connected branched curve
 * "Complex 1-variable polynomials with connected Julia sets and only repelling periodic points are called dendritic."
 * "a dendrite is a locally connected continuum that does not contain Jordan curves."
 * "a locally connected continuum without subsets homeomorphic to a circle"

Escape lines
Escape line = boundary of escape time's level sets

"If the escape radius is equal to 2 the contour lines have a contact point (c= -2) and cannot be considered as equipotential lines"

Invariant
Types:
 * topological
 * shift invariants

examples :
 * curve is invariant for the map f ( evolution function ) if images of every point from the curve stay on that curve
 * curve is invariant for a system of ordinary differential equations

"Quasi-invariant curves are used in the study of hedgehog dynamics" RICARDO PEREZ-MARCO

Examples:
 * field lines
 * external ray
 * internal ray

Equipotential lines
Equipotential lines = Isocurves of complex potential

"If the escape radius is greater than 2 the contour lines are equipotential lines"

Jordan curve


Jordan curve = a simple closed curve that divides the plane into an "interior" region bounded by the curve and an "exterior" region containing all of the nearby and far away exterior points

Lamination
Lamination of the unit disk is a closed collection of chords in the unit disc, which can intersect only in an endpoint of each on the boundary circle

It is a model of Mandelbrot or Julia set.

A lamination, L, is a union of leaves and the unit circle which satisfies :
 * leaves do not cross (although they may share endpoints) and
 * L is a closed set.

"The pattern of rays landing together can be described by a lamination of the disk. As θ is varied, the diameter defined by θ/2 and (θ +1)/2 is moving and disconnecting or reconnecting chords. " Wolf Jung

Leaf
 Chords = leaves = arcs   

A leaf on the unit disc is a path connecting two points on the unit circle.

"In Thurston’s fundamental preprint, the two characteristic rays and their common landing point are the “minor leaf” of a “lamination”"

Open curve
Curve which is not closed. Examples : line, ray.

Ray
Rays are :
 * invariant curves
 * dynamic or parameter
 * external, internal or extended

Extended
"We prolong an external ray R θ supporting a Fatou component U (ω) up to its center ω through an internal ray and call the resulting set the extended ray E θ with argument θ." Alfredo Poirier

Internal ray
Definition:
 * "The internal rays are the preimages of the radial segments under the coordinate with componenet center corresponding to 0." Alfredo Poirier

Internal rays are :
 * dynamic ( on dynamic plane, inside filled Julia set )
 * |parameter ( on parameter plane, inside Mandelbrot set ) usuning multiplier map

dynamic
For a parameter c with superattracting orbit: for every Fatou component $$ \mathit{U}$$ of filled julia set $$K_c$$ there is:
 * a unique periodic or pre-periodic point $$z_{\mathit{U}} $$ of the super-attracting orbit
 * a Riemann map that maps:

component to unit disc:


 * $$\varphi_{\mathit{U}} : \mathit{U} \to \mathbb{D} $$

and point $$z_{\mathit{U}}$$ to the origin:


 * $$ \varphi_{\mathit{U}}(z_{ \mathit{U}}) = 0 $$

The point $$ z_{\mathit{U}}$$ is called the center of component $$ \mathit{U}$$.

For any angle $$\vartheta \in  \mathbb R/\mathbb Z$$  the pre-image of the radial segment of the unit disc


 * $$\varphi^{-1}_{\mathit{U}}(r^{2\pi\vartheta}) : r \in [0,1] $$

is called an internal ray of component $$ \mathit{U}$$ with well-defined landing point.

where:
 * $$\mathbb R/\mathbb Z $$ is The quotient group R/Z

See also:
 * Hubbard tree

interwined
The internal rays are the curves that connects endpoints of external rays to the origin ( the only pole) by winding in the specific way through the Julia set. Unlike the external rays the internal rays allways cross other internal rays, usually at multiple points, hence they are interwined

Escape route
Escape route is a path inside Mandelbrot set.

Escape route 1/2 Plotting the Escape: An Animation of Parabolic Bifurcations in the Mandelbrot Set by Anne M. Burns. Mathematics Magazine Vol. 75, No. 2 (Apr., 2002), pp. 104-116
 * is part of the real slice of the mandelbrot set)
 * part of the real line x=0

Steps:
 * start from center of period 1
 * go along internal ray 1/2 to root point of period 2 component
 * go along internal ray 0 to the center of period 2 component
 * go along internal ray 1/2 to root point of period 4 component

Spider
A spider S is a collection of disjoint simple curves called legs ( extended rays = external + internal ray) in the complex plane connecting each of the post-critical points to infnity

See :
 * spider algorithm
 * spider program

Spine
In the case of complex_quadratic_polynomial $$f_c(z)=z^2 + c$$ the spine $$S_c\,$$ of the filled Julia set $$\ K \,$$ is defined as arc  between $$\beta\,$$-fixed point and  $$-\beta\,$$,

$$S_c = \left [ - \beta, \beta \right ]\,$$

with such properties:
 * spine lies inside $$\ K \,$$. This makes sense when $$K\,$$ is connected and full
 * spine is invariant under 180 degree rotation,
 * spine is a finite topological tree,
 * Critical point $$ z_{cr} = 0 \,$$ always belongs to the spine.
 * $$\beta\,$$-fixed point is a landing point of external ray of angle zero $$\mathcal{R}^K  _0$$,
 * $$-\beta\,$$ is landing point of external ray  $$\mathcal{R}^K  _{1/2}$$.

Algorithms for constructing the spine:
 * detailed version is described by A. Douady
 * Simplified version of algorithm:
 * connect $$- \beta\,$$ and $$ \beta\,$$ within $$K\,$$ by an arc,
 * when $$K\,$$ has empty interior then arc is unique,
 * otherwise take the shortest way that contains $$0$$.

Curve $$R\,$$ :

$$R\  \overset{\underset{\mathrm{def}}{}}{=} \  R_{1/2}\ \cup\  S_c\  \cup \ R_0 \,$$

divides dynamical plane into two components.

Computing external angle for c from centers of hyperbolic components and Misiurewicz points:

The spine of K is the arc from beta to minus beta. Mark 0 each time C is above the spine and 1 each time it is below. You obtain the expansion in base 2 of the external argument theta of z by C. This simply comes from the two following facts: * 0 < theta < 1/2 if acces to z is above the spine,   1/2 < theta < 1 if it is below * function f doubles the external arguments with respect to K, as well as the potential, since Riemman map ( Booettcher map) conjugates f to $$z \to z^2$$. Note that if c and z are real, the tree reduces to the segment [beta',beta] of the real line, and the sequence of 0 and 1 obtained is just the kneading sequence studied by Milnor and Thurston (except for convention: they use 1 and -1). This sequence appears now as the binary expansion of a number which has a geometrical interpretation. " A. Douady

Vein
"A vein in the Mandelbrot set is a continuous, injective arc inside in the Mandelbrot set"

"The principal vein $$v_{p/q}$$ is the vein joining $$c_{p/q}$$ to the main cardioid" (Entropy, dimension and combinatorial moduli for one-dimensional dynamical systems. A dissertation by Giulio Tiozzo )

= Discriminant=

In algebra, the discriminant of a polynomial is a polynomial function of its coefficients, which allows deducing some properties of the roots without computing them.

=Dynamics=
 * symbolic
 * complex
 * Arithmetic
 * combinatorial
 * local/global
 * discrete/continous
 * parabolic/hyperbolic/eliptic

Examples:
 * discrete local complex parabolic dynamics

symbolic
"Symbolic dynamics encodes :
 * a dynamical system $$f : X \to X$$ by a shift map on a space of sequences over finite alphabet using Markov paritition of the space $$X$$
 * the points of space $$X$$ by their itineraries with respect to the paritition " ( Volodymyr Nekrashevych - Symbolic dynamics and self-similar groups

=entropy=
 * image entropy

=equation=

differential
differential equations
 * exact analytic solutions.
 * approximated solution
 * use perturbation theory to approximate the solutions

=Field= Field is a region in space where each and every point is associated with a value.

The field types according to the value type :
 * scalar field
 * vector field, for example gradient field

=Function=

Derivative

 * Derivative of Iterated function (map)
 * of the function f with respect to variable ...
 * following the derivative

Derivative with respect to c
On parameter plane :
 * $$c$$ is a variable
 * $$z_0 = 0 $$ is constant


 * $$\frac{d}{dc} f^{(p)} _c (z_0) = z'_p \,$$

This derivative can be found by iteration starting with


 * $$z_0 = 0 \,$$
 * $$z'_0 = 1 \,$$

and then ( compute derivative before next z because it uses previous values of z):


 * $$z'_p = 2 \cdot z_{p-1}\cdot z'_{p-1} + 1 \,$$
 * $$z_p = z_{p-1}^2 + c \,$$

This can be verified by using the chain rule for the derivative.


 * $$\frac{dz_{n+1}}{dc} = \frac{d(z_n^2+ c)}{dc} = 2 z_n \frac{dz_n}{dc} + \frac{dc}{dc} = 2 z_n \frac{dz_n}{dc} + 1\,$$


 * Maxima CAS function :

dcfn(p, z, c) := if p=0 then 1 else 2*fn(p-1,z,c)*dcfn(p-1, z, c)+1;

Example values :
 * $$z_0 = 0 \qquad\qquad z'_0 = 1 \,$$
 * $$z_1 = c \qquad\qquad z'_1 = 1 \,$$
 * $$z_2 = c^2+c \qquad z'_2 = 2c+1 \,$$

It can be used for:
 * the distance estimation method for drawing a Mandelbrot set ( DEM/M )

Derivative with respect to z
$$z'_n\,$$ is first derivative with respect to z.

This derivative can be found by iteration starting with


 * $$z'_0 = 1 \,$$

and then :

$$z'_n= 2*z_{n-1}*z'_{n-1}\,$$

Derivation of recurrence relation:

$$ A_0 \quad \xrightarrow{definition\ of\ A}\ f^0 (z, c) \quad \xrightarrow{definition\ of\ f}\ \quad z $$

$$A_{m+1} \quad \xrightarrow{definition of A} f^{m+1} (z, c)  \quad \xrightarrow{definition\ of\ f} f (f^m (z, c), c)  \quad \xrightarrow{definition\ of\ A} f (A_m, c)  \quad \xrightarrow{definition\ of\ f} A_m ^ 2 + c $$

$$B_0 \quad \xrightarrow{definition\ of\ B}\ \dfrac{\partial}{\partial z} f^0 (z, c) \xrightarrow{definition\ of\ f}\ \dfrac{\partial}{\partial z} z \xrightarrow{derivative}\ 1 $$

$$B_{m+1} \quad \xrightarrow{definition\ of\ B} \dfrac{\partial}{\partial z} A_{m+1}  \quad \xrightarrow{definition\ of\ A} \dfrac{\partial}{\partial z} (A_m ^ 2 + c)  \quad \xrightarrow{distributivity} \dfrac{\partial}{\partial z} A_m ^ 2 + \dfrac{\partial}{\partial z} c  \quad \xrightarrow{constant\ derivative} \dfrac{\partial}{\partial z} A_m ^ 2 + 0  \quad \xrightarrow{zero } \dfrac{\partial}{\partial z} A_m ^ 2   \quad \xrightarrow{chain\ rule} 2 A_m (\dfrac{\partial}{\partial z} A_m)  \quad \xrightarrow{definition\ of\ B} 2 A_m B_m $$

It can be used for :
 * computing the external distance to the Julia set ( DEM/J )
 * detection of interior points of Mandelbrot set componnets

The Schwarzian Derivative
The Schwarzian Derivative

gradient
the gradient is the generalization of the derivative for the multivariable functions

definitions:
 * (field): Gradient field is the vector field with gradient vector
 * (function): The gradient of a scalar-valued multivariable function $$f(x, y)$$ is a vector-valued function denoted $$\nabla f $$
 * (vector): The gradient of the function f at the point (x,y) is defined as the unique vector ( result of gradient function) representing the maximum rate of increase of a scalar function ( length of the vector) and the direction of this maximal rate ( angle of the vector). Such vector is given by the partial derivatives with respect to each of the independent variables
 * (operator): Del or nabla is an gradient operator =  a vector differential operator

Notations:

$$ \nabla f(x,y) = [\frac{\partial f}{\partial x},  \frac{\partial f}{\partial y}] = \begin{bmatrix} \frac{\partial f}{\partial x} \\   \frac{\partial f}{\partial y}\end{bmatrix} = \frac{\partial f}{\partial x} \mathbf{i} + \frac{\partial f}{\partial y} \mathbf{j}$$

$$\operatorname{grad}f = \nabla f$$

See also
 * Gradient Descent Algorithm
 * Gradient Ascent Algorithm
 * image gradient

Jacobian
The Jacobian is the generalization of the gradient for vector-valued functions of several variables

Germ
Germ of the function f in the neighborhood of point z is a set of the functions g which are indistinguishable in that neighborhood


 * $$[f]_z = \{g : g \sim_z f\}.$$

See :
 * parabolic germ
 * the linearization of a germ

map

 * differences between map and the function
 * Iterated function = map
 * an evolution function of the discrete nonlinear dynamical system


 * $$z_{n+1} = f(z_n) \,$$

is called map $$f$$, examples:
 * rational maps
 * Newton maps
 * complex quadratic map : $$f_c : z \to z^2 + c. \,$$
 * exponential maps
 * trigonometric maps

Brjuno

 * Brjuno function

Links:
 * Quelle est la régularité de la fonction de Brjuno ?

harmonic
An harmonic or spherical function is a:
 * "set of orthogonal functions all of whose curvatures are changing at the same rate."
 * "harmonic functions relate two sets of different curves such that the rate of change of their respective curvatures is always equal. " and they are orthogonal
 * "One set of curves of the harmonic function expressed the pathways of minimal change in the potential for action, while the other, orthogonal curves expressed the pathways of maximum change in the potential for action."
 * "a pair of harmonic conjugate functions, u and v. They satisfy the Cauchy-Riemann equations. Geometrically, this implies that the contour lines of u and v intersect at right angles"

Geometric examples:
 * " A set of concentric circles and radial lines comprises an harmonic function because both the circles and the radial lines intersect orthogonally and both have constant curvature."
 * "a set of orthogonal ellipses and hyperbolas."

How to find harmonic conjugate function ?

meromorphic
meromorphic maps: Those with NO FINITE, NON-ATTRACTING FIXED POINTS

Critical
Critical polynomial :

$$Q_n = f_c^n(z_{cr}) = f_c^n(0) \,$$

so

$$Q_1 = f_c^1(0) = c \,$$

$$Q_2 = f_c^2(0) = c^2 + c \,$$

$$Q_3 = f_c^3(0) = (c^2 + c)^2 + c \,$$

These polynomials are used for finding :
 * centers of period n Mandelbrot set components. Centers are roots of n-th critical polynomials $$centers = \{ c : f_c^n(z_{cr}) = 0 \}\,$$ ( points where critical curve Qn croses x axis )
 * Misiurewicz points $$M_{n,k} = \{ c : f_c^k(z_{cr}) = f_c^{k+n}(z_{cr}) \}\,$$

post-critically finite
a post-critically finite polynomial = all critical points have finite orbit

Resurgent
"resurgent functions display at each of their singular points a behaviour closely related to their behaviour at the origin. Loosely speaking, these functions resurrect, or surge up - in a slightly different guise, as it were - at their singularities"

J. Écalle, 1980

Yoccoz’s function
=glitches= Definition:
 * Incorrect parts of renders using perturbation techique
 * pixels which dynamics differ significantly from the dynamics of the reference pixel "These can be detected and corrected by using a more appropriate reference."

Examples:
 * glitches in perturbation method

=graf=

Dessin d'enfant

 * wikipedia article : Dessin d'enfant
 * commons:Category:Dessins d'enfants (mathematics)

See also:
 * Polynomials Invertible in k-Radicals by Y. Burda, A. Khovanskii

Farey tree
Farey tree = Farey sequence as a tree

Hubbard tree

 * a simplified, combinatorial model of the Julia set ( MARY WILKERSON)
 * "Hubbard trees are finite planar trees, equipped with self-maps, which classify postcritically finite polynomials as holomorphic dynamical systems on the complex plane."
 * " Hubbard trees are invariant trees connecting the points of the critical orbits of post-critically finite polynomials. Douady and Hubbard showed in the Orsay Notes that they encode all combinatorial properties of the Julia sets. For quadratic polynomials, one can describe the dynamics as a subshift on two symbols, and itinerary of the critical value is called the kneading sequence." Henk Bruin and Dierk Schleicher

Rooted tree
rooted tree of preimages:


 * $$T_f := \bigsqcup_{n\ge 0}f^{-n}(t),$$

where a vertex $$z\in f^{-n}(t)$$ is connected by an edge with $$f(z)\in f^{-(n-1)}(t)$$.

=Iteration=

Iteration

=Magnitude =
 * magnitude of the point ( complex number in 2D case) = it's distance from the origin
 * radius is the absolute value of complex number ( compare to arguments or angle)

=Map= description

types

 * The map f is hyperbolic if every critical orbit converges to a periodic orbit.

c form : $$z^2+c$$
quadratic map f(z,c):=z*z+c;
 * math notation : $$f_c(z)=z^2+c\,$$
 * Maxima CAS function :

(%i1) z:zx+zy*%i; (%o1) %i*zy+zx (%i2) c:cx+cy*%i; (%o2) %i*cy+cx (%i3) f:z^2+c; (%o3) (%i*zy+zx)^2+%i*cy+cx (%i4) realpart(f); (%o4) -zy^2+zx^2+cx (%i5) imagpart(f); (%o5) 2*zx*zy+cy

Iterated quadratic map


 * math notation


 * $$ \ f^{(0)} _c (z) =  z = z_0$$
 * $$ \ f^{(1)} _c (z) =  f_c(z) = z_1$$

...
 * $$ \ f^{(p)} _c (z) =  f_c(f^{(p-1)} _c (z))$$

or with subscripts :
 * $$ \ z_p = f^{(p)} _c (z_0) $$


 * Maxima CAS function :

fn(p, z, c) := if p=0 then z  elseif p=1 then f(z,c) else f(fn(p-1, z, c),c);

zp:fn(p, z, c);

lambda form : $$ z^2+\lambda z$$
More description Maxima CAS code ( here m not lambda is used ) : (%i2) z:zx+zy*%i; (%o2) %i*zy+zx (%i3) m:mx+my*%i; (%o3) %i*my+mx (%i4) f:m*z+z^2; (%o4) (%i*zy+zx)^2+(%i*my+mx)*(%i*zy+zx) (%i5) realpart(f); (%o5) -zy^2-my*zy+zx^2+mx*zx (%i6) imagpart(f); (%o6) 2*zx*zy+mx*zy+my*zx

Switching between forms
Start from :
 * internal angle $$\theta = \frac {p}{q} $$
 * internal radius r

Multiplier of fixed point :


 * $$\lambda = r e^{2 \pi \theta i} $$

When one wants change from lambda to c :


 * $$c = c(\lambda) = \frac {\lambda}{2} \left(1 - \frac {\lambda}{2}\right) = \frac {\lambda}{2} - \frac {\lambda^2}{4} $$

or from c to lambda :


 * $$\lambda = \lambda(c) = 1 \pm \sqrt{1- 4 c}$$

Example values :

One can easily compute parameter c as a point c inside main cardioid of Mandelbrot set :

$$ c = c_x + c_y*i $$

of period 1 hyperbolic component ( main cardioid) for given internal angle ( rotation number) t using this c / cpp code by Wolf Jung

or this Maxima CAS code : /* conformal map from circle to cardioid ( boundary of period 1 component of Mandelbrot set */ F(w):=w/2-w*w/4;

/* circle D={w:abs(w)=1 } where w=l(t,r) t is angle in turns ; 1 turn = 360 degree = 2*Pi radians r is a radius ToCircle(t,r):=r*%e^(%i*t*2*%pi);

GiveC(angle,radius):= ( [w], /* point of unit circle   w:l(internalAngle,internalRadius); */ w:ToCircle(angle,radius),  /* point of circle */ float(rectform(F(w)))    /* point on boundary of period 1 component of Mandelbrot set */ )$

compile(all)$

/* -- global constants & var ---*/ Numerator :1; DenominatorMax :10; InternalRadius:1;

/* - main -- */ for Denominator:1 thru DenominatorMax step 1 do ( InternalAngle: Numerator/Denominator, c: GiveC(InternalAngle,InternalRadius), display(Denominator), display(c), /* compute fixed point */ alfa:float(rectform((1-sqrt(1-4*c))/2)), /* alfa fixed point */ display(alfa) )$

Circle map
Circle map
 * irrational rotation

Doubling map
definition

C function ( using GMP library) :


 * Maxima CAS function using numerator and denominator as an input

doubling_map(n,d):=mod(2*n,d)/d $

or using rational number as an input

DoublingMap(r):= block([d,n],        n:ratnumer(r),         d:ratdenom(r),         mod(2*n,d)/d)$


 * Common Lisp function


 * Haskell function


 * C++

Inverse function of doubling map
Every angle α ∈ R/Z measured in turns has :
 * one image = 2α mod 1 under doubling map
 * "two preimages under the doubling map: α/2 and (α + 1)/2.". Inverse of doubling map is multivalued function.

In Maxima CAS :

InvDoublingMap(r):= [r/2, (r+1)/2];

Note that difference between these 2 preimages


 * $$\frac{\alpha}{2} - \frac{\alpha +1}{2} = \frac{1}{2}$$

is half a turn = 180 degrees = Pi radians.

Feigenbaum map
"the Feigenbaum map F is a solution of Cvitanovic-Feigenbaum equation"

First return map

 * definition
 * video : Intro to Poincare map (Poincaré), the first return map. This map helps us determine the stability of a limit cycle using the eigenvalues (Floquet multipliers) associated with the map.

"In contrast to a phase portrait, the return map is a discrete description of the underlying dynamics. .... A return map (plot) is generated by plotting one return value of the time series against the previous one "

"If x is a periodic point of period p for f and U is a neighborhood of x, the composition $$f^{\circ p}\,$$  maps U to another neighborhood V of x. This locally defined map is the return map for x." ( W P Thurston : On the geometry and dynamics of Iterated rational maps)

"The first return map S → S is the map defined by sending each x0 ∈ S to the point of S where the orbit of x0 under the system first returns to S."

"way to obtain a discrete time system from a continuous time system, called the method of Poincar´e sections Poincar´e sections take us from : continuous time dynamical systems on (n + 1)-dimensional spaces to discrete time dynamical systems on n-dimensional spaces"

postcritically finite
postcritically finite: maps whose critical orbits are all periodic or preperiodic

" In the theory of iterated rational maps, the easiest maps to understand are postcritically finite: maps whose critical orbits are all periodic or preperiodic. These maps are also the most important maps for understanding the combinatorial structure of parameter spaces of rational maps. "

A postcritically finite quadratic polynomial fc(z) = z^2+c may be:
 * periodic of satellite type
 * periodic of primitive type
 * critically preperiodic (Misiurewicz type)

Examples are given by:
 * the Basilica Q(z) = z^2 − 1
 * the Kokopelli (
 * P(z) = z^2 + i ( dendrite)

Critically preperiodic polynomials

 * the critical point of fc is strictly preperiodic
 * parameter c is from Thurston-Misiurewicz points–values on the boundary of the Mandelbrot set = Misiurewicz point
 * Julia set is dendrite

Multiplier map
Multiplier map $$ \lambda $$ associated with hyperbolic component $$\Eta$$
 * gives an explicit uniformization of hyperbolic component $$\Eta$$ by the unit disk $$\mathbb{D} $$ :

$$ \lambda_p : \Eta \to \mathbb{D} $$

In other words it maps hyperbolic component H to unit disk D.

It maps point c from parameter plane to point b from reference plane:

$$ \lambda_p (c) = b $$

where:
 * c is a point in the parameter plane
 * b is a point in the reference plane. It is also internal coordinate
 * $$ \lambda$$ is a multiplier map

Multiplier map is a conformal isomorphism.

It can be computed using :
 * Newton_method : internal_coordinate by Claude Heiland-Allen
 * m-interior function

Riemann map
Riemann mapping theorem says that every simply connected subset U of the complex number plane can be mapped to the open unit disk D

$$ f : U \to D $$

where:
 * D is a unit disk $$D = \{z\in \mathbf{C} : |z| < 1\}.$$
 * f is Riemann map ( function)
 * U is subset of complex plane

Examples
 * multiplier map on the parameter plane
 * Böttcher coordinates
 * on the parameter plane the Riemann map for the complement of the Mandelbrot set
 * on dynamic plane
 * for the Fatou component containing a superattracting fixed point for a rational map
 * a Riemann map for the complement of the filled Julia set of a quadratic polynomial with connected Julia : "The Riemann map for the central component for the Basilica was drawn in essentially the same way, except that instead of starting with points on a big circle, I started with sample points on a circle of small radius (e.g. 0.00001) around the origin." Jim Belk

function:
 * explicit formula ( only in simple cases)
 * numerical aproximation ( in most of the cases)
 * Zipper
 * https://code.google.com/archive/p/zipper/
 * https://sites.math.washington.edu/~marshall/zipper.html
 * " Thurston and others have done some beautiful work involving approximating arbitrary Riemann maps using circle packings. See Circle Packing: A Mathematical Tale by Stephenson."
 * " To some extent, constructing a Riemann map is simply a matter of constructing a harmonic function on a given domain (as well as the associated harmonic conjugate), subject to certain boundary conditions. The solution to such problems is a huge topic of research in the study of PDE's, although the connection with Riemann maps is rarely mentioned." Jim Belk

PDE's approach to construct a Riemann map explicitly on a given domain D  $$ F(z) \;=\; -\log |z| $$ for all $$z\in\partial D$$, and let
 * First, translate the domain so that it contains the origin.
 * Next, use a numerical method to construct a harmonic function F satisfying

$$R(z) = |z|e^{F(z)}$$

Then
 * $$R(0) = 0$$
 * $$R|_{\partial D} \equiv 1$$
 * and $$\log R$$ is harmonic

so:
 * R is the radial component (i.e. modulus) of a Riemann map on D.
 * The angular component can now be determined by the fact that its level curves are perpendicular to the level curves of R, and have equal angular spacing near the origin."

See commons : Category:Riemann_mapping

Rotation map
"If a is rational, then every point is periodic. If a is irrational, then every point has a dense orbit." David Richeson

rational
Rotation map  $$R$$ describes counterclockwise rotation of point $$ \theta$$ thru   $$ \frac{p}{q}$$ turns on the unit circle :

$$ R_{\frac{p}{q}}(\theta) = \theta + \frac{p}{q} $$

It is used for computing :
 * itinerary

irrational

 * ROTATE IN A CIRCLE WITH A ROTATION by  Sylvie Ruette ( in fr. )
 * wikipedia : Irrational rotation

Shift map
names :
 * bit shift map ( because it shifts the bit ) = if the value of an iterate is written in binary notation, the next iterate is obtained by shifting the binary point one bit to the right, and if the bit to the left of the new binary point is a "one", replacing it with a zero.
 * 2x mod 1 map ( because it is math description of it's action )

Shift map (one-sided binary left shift ) acts on one-sided infinite sequence of binary numbers by

$$ \sigma(b_1, b_2, b_3, \ldots) = (b_2, b_3, b_4, \ldots)$$

It just drops first digit of the sequence.

$$ \sigma^2(S) = \sigma(\sigma(S))$$

$$\sigma^k(b_1 b_2 \ldots) = b_{k+1} b_{k+2} \ldots$$

If we treat sequence as a binary fraction :

$$ x = 0.b_1, b_2, b_3, \ldots$$

then shift map = the dyadic transformation = dyadic map = bit shift map= 2x mod 1 map =  Bernoulli map = doubling map = sawtooth map

$$ \sigma(x) = 2 x \bmod 1$$

and "shifting N places left is the same as multiplying by 2 to the power N (written as 2N)" ( operator << )

In Haskell:

See also:
 * How to compute external angles of principal Misiurewicz points of wakes?

= Multiplier =

Multiplier of periodic z-point :
 * "The value of $$(f^p)^\prime$$ is the same at any point in the orbit of a: it is called the multiplier of the cycle."

Math notation :

$$\lambda_c(z) = \frac{df_c^{(p)}(z)}{dz}\,$$

Maxima CAS function for computing multiplier of periodic cycle :

m(p):=diff(fn(p,z,c),z,1);

where p is a period. It takes period as an input, not z point.

It is used to :
 * compute stability index of periodic orbit ( periodic point) = $$|\lambda| = r $$ ( where r is a n internal radius
 * multiplier map

" The multiplier of a fixed point gives information about its stability (the behaviour of nearby orbits )"

=Number=

complex number

 * numerical value : x+y*i
 * vector from origin to point ( x,y)
 * point (x,y) od 2D Cartesion plain

Fegenbaum constant

 * first ( delta)
 * second ( alpha)

How to compute:
 * Keith Briggs: How to calculate
 * octave program by Anton Hendricson
 * python program by cdlane
 * Rosettacode
 * An efficient method for the computation of the Feigenbaum constants to high precision by Andrea Molteni (Submitted on 7 Feb 2016)

Rotation number
The rotation number of the disk ( component) attached to the main cardioid of the Mandelbrot set is a proper, positive rational number p/q in lowest terms where :
 * q is a period of attached disk ( child period ) = the period of the attractive cycles of the Julia sets in the attached disk
 * p descibes fc action on the cycle : fc turns clockwise around z0 jumping, in each iteration, p points of the cycle

Features :
 * in a contact point ( root point ) it agrees with the internal angle
 * the rotation numbers are ordered clockwise along the boundary of the componant
 * " For parameters c in the p/q-limb, the filled Julia set Kc has q components at the fixed point αc . These are permuted cyclically by the quadratic polynomial fc(z), going p steps counterclockwise " Wolf Jung

Winding number

 * of the map ( iterated function)
 * "the winding number of the dynamic ray at angle a around the critical value, which is defined as follows: denoting the point on the dynamic a-ray at potential t greater or equal to zero by zt and decreasing t from +infinity to 0, the winding number is the total change of arg(zt - c) (divided by 2*Pi so as to count in full turns). Provided that the critical value is not on the dynamic ray or at its landing point, the winding number is well-defined and finite and depends continuously on the parameter. " DIERK SCHLEICHER
 * of the curve
 * the winding number of a curve is the number of complete rotations, in the counterclockwise sense, of the curve around the point(0, 0).
 * w(γ, x) = number of times curve γ winds round point x. The winding number is signed: + for counterclockwise, − for clockwise.

Computing winding number of the curve ( which is not crossing the origin ) using:
 * numerical integration
 * computational geometry

The discrete winding number = winding number of polygon aproximating curve

=Orbit= Orbit is a sequence of points
 * phase space trajectories of dynamical systems
 * The orbit of periodic point is finite and it is called a cycle.

Critical
Forward orbit of a critical point is called a critical orbit. Critical orbits are very important because every attracting periodic orbit attracts a critical point, so studying the critical orbits helps us understand the dynamics in the Fatou set.

$$z_0 = z_{cr} = 0\,$$

$$z_1 = f_c(z_0) = c\,$$

$$z_2 = f_c(z_1) = c^2 +c\,$$

$$z_3 = f_c(z_2) = (c^2 + c)^2 + c\,$$

$$... \,$$

This orbit falls into an attracting periodic cycle.

Code :

Here are images:
 * images of critical orbitsat commons
 * by Mike Croucher
 * Chris King
 * Kerry Mitchel: cardioid-boundary-orbits
 * Visualizing Escape Paths in the Mandelbrot Set by Anne M. Burns
 * list:
 * critical orbits
 * Lori GardiThe Mandelbrot set and the fractal nature of light, the Universe, and everything by
 * The Mandelbrot Set as a Quasi-Black Hole by Lori Gardi
 * Mandelbrot Z Orbits by Stefan Bion
 * images by Conan written in Rainbow
 * intro
 * examples
 * Mandelbrot Sequences and Orbits by Stefan Forcey
 * programs
 * Geogebra ( interactive)
 * Mandelbrot Iteration Orbits by Ben Sparks
 * Mandelbrot kümesi by Hüseyin KAVAK

See also:
 * Java Script by Stefan Forcey
 * Spreading points on a disc

Inverse
Inverse = Backward

skipped

 * set containing first n iterations of initial point without initial point and its k iterations
 * number of elements = n - k

$$\mathcal O _{n,k} (z) = \{z_{n-k}, z_{n-k+1}, \ldots z_n\}$$

It is used in the average colorings

truncated

 * set containing initial point and first n iterations of initial point
 * number of elements = n+1

$$\mathcal O _n (z) = \{z, f(z), \ldots f^n(z)\} = \{z_0, z_1, \ldots z_n\}$$

=Parameter=

Parameter
 * point of the parameter plane " is renormalizable if restriction of some of its iterate gives a polinomial-like map of the same or lower degree. "
 * parameter of the function

=Period=

Period of point $$z_0$$ under the iterarted function f is the smallest positive integer value p for which this equality $$ f^p(z_0) = z_0 $$ holds is the period of the orbit.

$$ z_0 $$ is a point of periodic orbit ( limit cycle ) $$\{z_0, \dots, z_{p-1} \}$$.

More is here

=Plane= Planes

Douady’s principle : “sow in dynamical plane and reap in parameter space”.

paritition
Examples:


 * Markow
 * Yoccoz puzzle

Kneading paritition of the dynamic plane
In case of critically preperiodic polynomials the partition of the dynamic plane used in the definition of the kneading sequence.

Partition is formed by the dynamic rays at angles: which land together at the critical point.
 * t/2
 * (t + 1)/2

Angle t is angle which lands on the critical value:


 * $$ z = c $$

Spine paritition of the dynamic plane
Curve $$R\,$$ :

$$R\  \overset{\underset{\mathrm{def}}{}}{=} \  R_{1/2}\ \cup\  S_c\  \cup \ R_0 \,$$

where:
 * R is an dynamic external ray
 * S is the spine of Julia set

divides dynamical plane into two components.

crossing/noncrossing
noncrossing: "A partition of a (finite) set is just a subdivision of the set into disjoint subsets. If the set is represented as points on a line (or around the edge of a disc), we can represent the partition with lines connecting the dots. The lines usually have lots of crossings. When the partition diagram has no crossing lines, it is called a non-crossing partition. ... They have a lot of beautiful algebraic structure, and are related to lots of old enumeration problems. More recently (and importantly), they turn out to be a crucial tool in understanding how the eigenvalues of large random matrices behave." Todd Kemp (UCSD)

Key words:
 * Enumerative combinatorics

types

 * slit plane = plane with the slit deleted : Let S be the "slit plane" $$S = \mathbb{C} - \{t \in \mathbb{R} : t \leq 0\}$$
 * chessboard or checkerboards

Dynamic plane or phase space

 * z-plane for fc(z)= z^2 + c
 * z-plane for fm(z)= z^2 + m*z

Parameter plane
See :

Types of the parameter plane :
 * c-plane ( standard plane )
 * exponential plane ( map)
 * flatten' the cardiod ( unroll )  =  "A region along the cardioid is continuously blown up and stretched out, so that the respective segment of the cardioid becomes a line segment. .." ( Figure 4.22 on pages 204-205 of The Science Of Fractal Images)
 * transformations

=Points=

Band-merging
the band-merging points are Misiurewicz points

Biaccessible
If there exist two distinct external rays landing at point we say that it is a biaccessible point.

Buried
" a point of the Julia set is buried if it is not in the boundary of any Fatou component."

polynomials do not have buried points

some rational Julia sets have ( Residual Julia Set = Buried Points )

Nucleus or center of hyperbolic component
A center of a hyperbolic component H is a parameter $$ c_0 \in H\,$$ ( or point of parameter plane )  such that the corresponding periodic orbit has multiplier= 0."

Synonyms :
 * Nucleus of a Mu-Atom

How to find center/s ?

Center of Siegel Disc
Center of Siegel disc is a irrationally indifferent periodic point.

Mane's theorem :

"... appart from its center, a Siegel disk cannot contain any periodic point, critical point, nor any iterated preimage of a critical or periodic point. On the other hand it can contain an iterated image of a critical point."

Critical
A critical point of $$f_c\,$$ is a point $$ z_{cr} \,$$ in the dynamical plane such that the derivative vanishes:


 * $$f_c'(z_{cr}) = 0. \,$$

Since


 * $$f_c'(z) = \frac{d}{dz}f_c(z) = 2z $$

implies


 * $$ z_{cr} = 0\,$$

we see that the only (finite) critical point of $$f_c \,$$ is the point $$ z_{cr} = 0\,$$.

$$z_0$$ is an initial point for Mandelbrot set iteration.

A critical value is an image of critical point

Cut
Cut point k of set S is a point for which set S-k is dissconected ( consist of 2 or more sets). This name is used in a topology.

Examples :
 * root points of Mandelbrot set
 * Misiurewicz points of boundary of Mandelbrot set
 * cut points of Julia sets ( in case of Siegel disc critical point is a cut point )

These points are landing points of 2 or more external rays.

Point which is a landing point of 2 external rays is called biaccesible

Cut ray is a ray which converges to landing point of another ray. Cut rays can be used to construct puzzles.

Cut angle is an angle of cut ray.

fixed
Periodic point when period = 1

Feigenbaum
The Feigenbaum Point is a : $$MF^{(n)} (\tfrac{p}{q}) = c $$
 * point c of parameter plane
 * is the limit of the period doubling cascade of bifurcations
 * an infinitely renormalizable parameter of bounded type
 * boundary point between chaotic ( -2 < c < MF )  and periodic region ( MF< c < 1/4)

Generalized Feigenbaum points are : Examples :
 * the limit of the period-q cascade of bifurcations
 * landing points of parameter ray or rays with irrational angles
 * $$MF^{(0)} = MF^{(1)} (\tfrac{1}{2}) = c = -1.401155 $$
 * -.1528+1.0397i)

The Mandelbrot set is conjectured to be self- similar around generalized Feigenbaum points when the magnification increases by 4.6692 (the Feigenbaum Constant) and period is doubled each time


 * {| class="wikitable"

! n ! Period = 2^n ! Bifurcation parameter = cn ! Ratio $$= \dfrac{c_{n-1}-c_{n-2}}{c_n-c_{n-1}} $$
 * 1
 * 2
 * -0.75
 * N/A
 * 2
 * 4
 * -1.25
 * N/A
 * 3
 * 8
 * -1.3680989
 * 4.2337
 * 4
 * 16
 * -1.3940462
 * 4.5515
 * 5
 * 32
 * -1.3996312
 * 4.6458
 * 6
 * 64
 * -1.4008287
 * 4.6639
 * 7
 * 128
 * -1.4010853
 * 4.6682
 * 8
 * 256
 * -1.4011402
 * 4.6689
 * 9
 * 512
 * -1.401151982029
 * 10
 * 1024
 * -1.401154502237
 * infinity
 * -1.4011551890 ...
 * }
 * 9
 * 512
 * -1.401151982029
 * 10
 * 1024
 * -1.401154502237
 * infinity
 * -1.4011551890 ...
 * }
 * infinity
 * -1.4011551890 ...
 * }
 * -1.4011551890 ...
 * }
 * }

Bifurcation parameter is a root point of period = 2^n component. This series converges to the Feigenbaum point c = −1.401155

The ratio in the last column converges to the first Feigenbaum constant.

" a "Feigenbaum point" (an infinitely renormalizable parameter of bounded type, such as the famous Feigenbaum value which is the limit of the period-2 cascade of bifurcations), then Milnor's hairiness conjecture, proved by Lyubich, states that rescalings of the Mandelbrot set converge to the entire complex plane. So there is certainly a lot of thickness near such a point, although again this may not be what you are looking for. It may also prove computationally intensive to produce accurate pictures near such points, because the usual algorithms will end up doing the maximum number of iterations for almost all points in the picture." Lasse Rempe-Gillen

Fibonacci
Fibonacci point

infinity
The point at infinity " is a superattracting fixed point, but more importantly its immediate basin of attraction - that is, the component of the basin containing the fixed point itself - is completely invariant (invariant under forward and backwards iteration). This is the case for all polynomials (of degree at least two), and is one of the reasons that studying polynomials is easier than studying general rational maps (where e.g. the Julia set - where the dynamics is chaotic - may in fact be the whole Riemann sphere). The basin of infinity supports foliations into "external rays" and "equipotentials", and this allows one to study the Julia set. This idea was introduced by Douady and Hubbard, and is the basis of the famous "Yoccoz puzzle"." Lasse Rempe-Gillen



Misiurewicz
Misiurewicz point = " parameters where the critical orbit is pre-periodic.

Myrberg-Feigenbaum
MF = the Myrberg-Feigenbaum point is the different name for the Feigenbaum Point.

Parabolic point
parabolic points : this occurs when two singular points coallesce in a double singular point (parabolic point)

"the characteristic parabolic point (i.e. the parabolic periodic point on the boundary of the critical value Fatou component) of fc"

Periodic
Point z has period p under f if :


 * $$ z : \ f^{p} (z) =  z $$

In other words point is periodic

See also:
 * fixed point
 * stability of periodic point
 * attracting
 * repelling
 * indifferent
 * multiplier of periodic cycle

Pinching
"Pinching points are found as the common landing points of external rays, with exactly one ray landing between two consecutive branches. They are used to cut M or K into well-defined components, and to build topological models for these sets in a combinatorial way. " ( definition from Wolf Jung program Mandel )

other names
 * pinch points
 * cut points

See for examples :
 * period 2 = Mandel, demo 2 page 3.
 * period 3 = Mandel, demo 2 page 5

Pool
"A point in the dendrite is called a pool if it is the landing point for two external rays, both of whose angles are of the form

$$\frac{k}{ 12* 2^n}$$

for some k, n ∈ N, where k ≡ 1 mod 6.

...

central pool ... it is geometrically the center of the dendrite; a one half rotation around this point maps the dendrite to itself."

post-critical
A post-critical point is a point $$ z = f(f(f( ... (z_{cr})))) $$ where $$z_{cr}$$ is a critical point.

precritical
precritical points, i.e., the preimages of the critical point

reference point
Reference point of the image:
 * its orbit ( reference orbit) is computed with arbitrary precision and saved
 * orbits of the other points of the image ( no-reference points) are computed from reference orbit using standard precision ( with hardware floating point numbers ) = faster then using arbitrary precision

renormalizable
point of the parameter plane " is renormalizable if restriction of some of its iterate gives a polinomial-like map of the same or lower degree. "

infinitely renormalizable
" a "Feigenbaum point" (an infinitely renormalizable parameter of bounded type, such as the famous Feigenbaum value which is the limit of the period-2 cascade of bifurcations), then Milnor's hairiness conjecture, proved by Lyubich, states that rescalings of the Mandelbrot set converge to the entire complex plane. So there is certainly a lot of thickness near such a point, although again this may not be what you are looking for. It may also prove computationally intensive to produce accurate pictures near such points, because the usual algorithms will end up doing the maximum number of iterations for almost all points in the picture." Lasse Rempe-Gillen

root or bond
The root point of the hyperbolic componnet of the Mandelbrot set :
 * A point where two mu-atoms meet
 * has a rotational number 0
 * it is a biaccesible point ( landing point of 2 external rays )

Names:
 * bond

singular
the singular points of a dynamical system

In complex analysis there are four classes of singularities:


 * Isolated singularities: Suppose the function f is not defined at a, although it does have values defined on U \ {a}.
 * The point a is a removable singularity of f if there exists a holomorphic function g defined on all of U such that f(z) = g(z) for all z in U \ {a}. The function g is a continuous replacement for the function f.
 * The point a is a pole or non-essential singularity of f  if there exists a holomorphic function g defined on U with g(a) nonzero, and a natural number n such that f(z) = g(z) / (z &minus; a)n for all z in U \ {a}. The least such number n is called the order of the pole. The derivative at a non-essential singularity itself has a non-essential singularity, with n increased by 1 (except if n is 0 so that the singularity is removable).
 * The point a is an essential singularity of f if it is neither a removable singularity nor a pole. The point a is an essential singularity if and only if the Laurent series has infinitely many powers of negative degree.
 * Branch points are generally the result of a multi-valued function, such as $$\sqrt{z}$$ or $$\log(z)$$ being defined within a certain limited domain so that the function can be made single-valued within the domain. The cut is a line or curve excluded from the domain to introduce a technical separation between discontinuous values of the function. When the cut is genuinely required, the function will have distinctly different values on each side of the branch cut. The shape of the branch cut is a matter of choice, however, it must connect two different branch points (like $$z=0$$ and $$z=\infty$$ for $$\log(z)$$) which are fixed in place.

triple
"A point in the dendrite is called a triple point if its removal separates the dendrite into three connected components. Such a point is the landing point for three external rays, whose angles all have of the form

$$\frac{k}{7 *2^n}$$

for some k, n ∈ N, where k is congruent to 1, 2 or 4, mod 7." Will Smith in Thompson-Like Groups for Dendrite Julia Sets

=Portrait=

types
There are two types of orbit portraits: primitive and satellite. If $$v$$ is the valence of an orbit portrait $$\mathcal P$$ and $$r$$ is the recurrent ray period, then these two types may be characterized as follows:
 * Primitive orbit portraits have $$r = 1$$ and $$v = 2$$. Every ray in the portrait is mapped to itself by $$f^n$$.  Each $$A_j$$ is a pair of angles, each in a distinct orbit of the doubling map.  In this case, $$r_{\mathcal P}$$ is the base point of a baby Mandelbrot set in parameter space.
 * Satellite ( non-primitive ) orbit portraits have $$r = v \ge 2$$. In this case, all of the angles make up a single orbit under the doubling map.  Additionally,  $$r_{\mathcal P}$$ is the base point of a parabolic bifurcation in parameter space.

Critical
Critical orbit portrait = portrait of the critical orbit


 * ... for the polynomial $$z \to z^2 + i$$ we may note the critical orbit portrait:


 * $$0 \to i \to -1 + i \to -i \to -1 + i$$

for this map, or we may double the angles of external rays and record the locations of landing points in order to observe the same behavior."

=Precision= Precision of :
 * data type used for computation. Measured in bits (width of significant ( fraction) = number of binary digits) or in decimal digits
 * input values
 * result ( number of significant figures )

See : = Principle=
 * Numerical Precision : " Precision is the number of digits in a number. Scale is the number of digits to the right of the decimal point in a number. For example, the number 123.45 has a precision of 5 and a scale of 2."
 * error

Douady’s principle
Douady’s principle : “sow in dynamical plane and reap in parameter space”.

=Problem=

small divisor problem
Types
 * One-Dimensional Small Divisor Problems (On Holomorphic Germs and Circle Diffeomorphisms)

Where it can be found:
 * stability in mechanics, particularly in celestial mechanics
 * relations between the growth of the entries in the continued fraction expansion of t and the behaviour of f around z=0 under iteration.

See:
 * Linearization in scholarpedia

=Processes or transformations and phenomenona =

Aliasing and antialising

 * aliasing

Contraction and dilatation

 * the contraction z → z/2
 * the dilatation z → 2z.

differentiation
Method of computing the derivative of a mathematical function

types:
 * symbolic differentiation
 * Automatic Differentiation (AD)
 * numeric differentiation  = the method of finite differences

Discretizations

 * discretization and its reverse
 * discretize/homogenize in the DDG ( Discrete Differential Geometry)

Implosion and explosion
Implosion is :
 * the process of sudden change of quality fuatures of the object, like collapsing (or being squeezed in)
 * the opposite of explosion

Example : Explosion is a :
 * parabolic implosion in complex dynamics ( $$\bold{C}$$ )
 * when filled Julia for complex quadratic polynomial set looses all its interior ( when c goes from 0 along internal ray 0 thru parabolic point c=1/4 and along extrnal ray 0 = when c goes from interior, crosses the bounday to the exterior of Mandelbrot set)
 * " We can see that $$J_{\frac{1}{4}+.0005}$$ looks somewhat like $$J_{\frac{1}{4}}$$ from the "outside", but on the "inside" there are curlicues; pairs of them are vaguely reminiscent of "butterflies". As t→0, these butterflies persist and remain uniformly large. We think of t as representing time, which decreases to 0. The fact that they suddenly disappear for t=0 is the phenomenon called "implosion". Or, if we think of time starting at t=0, then the instantaneous appearance of large "butterflies" for t>0 may be thought of as "explosion". "
 * Semi-parabolic implosion in $$\bold{C}^2$$
 * sudden change of quality fuatures of the object in an extreme manner,
 * the opposite of implosion

Example : in exponential dynamics when λ> 1/e, the Julia set of $$E_{\lambda}(z) = \lambda e^z$$ is the entire plane.

Linearization

 * changing from non-linear to linear
 * " ... turn the perturbated linear map $$f :  \lambda z + z^2 \mapsto \lambda z $$ into the exactly linear map $$y \mapsto \lambda y $$ ( it linearizes $$f$$ )" Jean-Christophe Yoccoz
 * linearization in english wikipedia
 * Linearization in scholarpedia
 * "System is linearizable at the origin if and only if there exists a change of coordinates which linearizes the system, that is, all the coefficients of the normal form vanish."

Mating
Mating

Normalization
Normalize
 * normalize = transformation to the model
 * " normalize this vector so it has modulus one " A Cheritat
 * move fixed point to the origin ( z= 0 )
 * mapping the range of variable to standard range
 * [0.0, 1.0]
 * [0,255], like rgb values
 * converting closed curve to unit circle
 * converting closed curves to concentric circles with center at the origin

See also:
 * uniformization
 * renormalization

Parametrization

 * Parametrization is the process of finding parametric equations of a curve

Perturbation

 * Perturbation technque for fast rendering the deep zoom images of the Mandelbrot set
 * perturbation of parabolic point
 * use perturbation theory to approximate the solutions of the differential equations
 * perturbation of point x : $$ x \to x + \epsilon $$ where epsilon is absolute value of aproximation error

Renormalization
"to any quadratic map f we can associate a canonical sequence of periods p1 < p2 <... for which f is renormalizable.

Depending on whether the sequence is: the map f is called respectively:
 * empty
 * finite
 * infinite
 * non-renormalizable
 * at most finitely renormalizable
 * infinitely renormalizable"

"Sectorial renormalizations are useful in the nonlinearizable situation. " Ricardo Pérez-Marco

Surgery

 * surgery in differential topology
 * regluing

Links:
 * http://mathoverflow.net/questions/tagged/surgery-theory

Tuning

 * definition
 * examples
 * subwake
 * island

Vectorisation
= property or feature =

density of the image
Dense image
 * downsaling with gamma correction
 * path finding
 * supersampling: "ots of detail but fractal fades away as you get more accurate, as n increases in nxn supersampling" TGlad

Hyperbolic/parabolic/eliptic
The meaning of the terms "elliptic, hyperbolic, parabolic" in different disciplines in mathematics
 * PDE ( Linear Second Order PDE’s in two Independent Variables) :
 * Moebius transformations :
 * dicrete local complex dynamics
 * Conic section
 * Quadratic form
 * probability distributions.

Invariant
sth is invariant with respect to the transformation = non modified, steady

Topological methods for the analysis of dynamical systems

Invariants type
 * metric invariants
 * dynamical invariants,
 * topological invariants.

dynamical
Dynamical invariants = invariants of the dynamical system
 * periodic points
 * fixed point
 * invariant curve
 * periodic ray
 * external
 * internal

Dynamical Invariants Derived from Recurrence Plots

smooth
smooth = changing without visible (noticeable) edges

use:
 * smooth gradient

similar:
 * conitnuous

compare:
 * discrete

Stability

 * stability of quasiperiodic motion under small perturbation. In the celestial mechanics dynamics of 3 bodies around sun is described by the system of differential equations. In such case it "becomes fantastically complicated and remains largely mysterious even today." See KAM = Kolmogorov–Arnold–Moser theorem and small divisor problem
 * stability of the fixed point under small perturbation
 * there is equivalence (for |f′(0)| ≤ 1) of stability (a topological notion) and linearizability (an analytical notion)

Compare with:
 * shadowing lemma
 * Sensitive dependence on initial conditions - Butterfly effect

=Radius=

Radius of complex number
The absolute value or modulus or magnitude or radius of a complex number

Conformal radius
Conformal radius of Siegel Disk

Escape radius ( ER)
Escape radius ( ER ) or bailout value is a radius of circle centered at origin ( z=0). This set is used as a target set in the bailout test ( escape time method = ETM )

Minimal Escape Radius should be grater or equal to 2 : $$ ER =  max ( 2, |c| )\,$$

Better estimation is :

$$ER = \frac{1}{2} +\sqrt{\frac{1}{4} + |c| }$$

Inner radius
Inner radius of Siegel Disc
 * radius of inner circle, where inner circle with center at fixed point is the biggest circle inside Siegel Disc.
 * minimal distance between center of Siel Disc and critical orbit

Internal radius
Internal radius is a:
 * absolute value of multiplier $$r = |\lambda| $$

See also : the N-2 rule

=Sequences=

A sequence is an ordered list of objects (or events).

A series is the sum of the terms of a sequence of numbers. Some times these names are not used as in above definitions.

Itinerary
$$S(x)$$ is an itinerary of point x under the map f relative to the paritirtion.

It is a right-infinite sequence of zeros and ones

$$ S(x) = s_1s_2s_3...s_n$$

where

Examples :
 * internal angle and wake

For rotation map $$R_{p/q}$$ and invariant interval $$I$$ ( circle ) :

$$ I = (0,1] $$

one can compute $$ x_c$$ :

$$ x_c = 1 - \frac{p}{q}$$

and split interval into 2 subintervals ( lower circle paritition): $$ I_0 =(0,x_c]$$ $$ I_1 =(x_c, 1]$$

then compute s according to it's relation with critical point :

$$ s_n = \begin{cases} 0 : x_n < x_c \\ 1 : x_n > x_c \end{cases}

$$

Itinerary can be converted to point $$x \in [0, 1]$$

$$ \gamma(S_n) = 0.s_1s_2s_3...s_n = \sum_{n=0}^{n-1}\frac{s_n}{2^n} = x_n$$

kneading sequence

 * "the kneading sequence of an external angle ϑ (here ϑ = 1/6) is defined as the itinerary of the orbit of ϑ under angle doubling, where the itinerary is taken with respect to the partition formed by the angles ϑ/2, and (ϑ + 1)/2 "
 * The itinerary ν = ν1ν2ν3 . . . of the critical value is called the kneading sequence. One can start from the critical point but neglect the initial symbol. Such sequence is computed with the Hubbard tree

Thue–Morse sequence
Thue–Morse sequence
 * how to compute it

Orbit
Orbit can be:
 * forward = sequence of points
 * backward ( inverse )
 * tree in case of multivalued function
 * sequence

=Series=

A series is the sum of the terms of a sequence of numbers. Some times these names are not used as in above definitions.

Taylor

 * Taylor series and Mandelbrot set
 * The Existence and Uniqueness of the Taylor Series of Iterated Functions

=Set=

Continuum
definition

Components of parameter plane
Names:
 * mu-atom
 * ball
 * bud
 * bulb
 * decoration
 * lake
 * lakelet.

Islands
Names :
 * mini Mandelbrot set
 * 'baby'-Mandelbrot set
 * island mu-molecules = embedded copy of the Mandelbrot Set
 * Bug
 * Island
 * Mandelbrotie
 * Midget

List of islands :
 * http://mrob.com/pub/mu-data/largest-islands.txt
 * http://mrob.com/pub/muency/largestislands.html
 * http://www.math.cornell.edu/~rperez/Documents/maximals.pdf
 * http://fraktal.republika.pl/mset_external_ray_mini.html
 * http://mathr.co.uk/mandelbrot/feature-database.csv.bz2 ( a database of all islands up to period 16, found by tracing external rays): period, islandhood, angled internal address, lower external angle numerator, denominator, upper numerator, denominator, orientation, size, centre realpart, imagpart

Primitive and satellite
"Hyperbolic components come in two kinds, primitive and satellite, depending on the local properties of their roots." point
 * primitive ( non-satellite)
 * the root of component is not on the boundary of another component = "it was born from another hyperbolic component by the period increasing bifurcation"
 * ones that have a cusp likes the main cardioid, when the little Julia sets are disjoint
 * satellite
 * ones that don't have a cusp
 * it's root is on the boundary of another hyperbolic component
 * when the little Julia sets touch at their β-fixed

Child (Descendant ) and the parent ( ancestor)

 * ancestor of hyperbolic componnet
 * descendant of hyperbolic component = child

Hyperbolic component of Mandelbrot set
Domain is an open connected subset of a complex plane.

"A hyperbolic component H of Mandelbrot set is a maximal domain (of parameter plane) on which $$f_c\,$$ has an attracting periodic orbit.

A center of a H is a parameter $$ c_0 \in H\,$$ ( or point of parameter plane )  such that the corresponding periodic orbit has multiplier= 0."

A hyperbolic component is narrow if it contains no component of equal or lesser period  in its wake

features of hyperbolic component
 * period
 * islandhood ( shape = cardiod or circle )
 * angled internal address
 * lower and upper external angle of rays landing on it's root
 * center (
 * root
 * orientation
 * size

Limb
p/q-limb is a part of Mandelbrot set contained inside p/q-wake

For every rational number $$\tfrac{p}{q}$$, where p and q are relatively prime, a hyperbolic component of period q bifurcates from the main cardioid. The part of the Mandelbrot set connected to the main cardioid at this bifurcation point is called the p/q-limb. Computer experiments suggest that the diameter of the limb tends to zero like $$\tfrac{1}{q^2}$$. The best current estimate known is the Yoccoz-inequality, which states that the size tends to zero like $$\tfrac{1}{q}$$.

A period-q limb will have q − 1 "antennae" at the top of its limb. We can thus determine the period of a given bulb by counting these antennas.

In an attempt to demonstrate that the thickness of the p/q-limb is zero, David Boll carried out a computer experiment in 1991, where he computed the number of iterations required for the series to converge for z = $$-\tfrac{3}{4} + i\epsilon$$ ($$-\tfrac{3}{4}$$ being the location thereof). As the series doesn't converge for the exact value of z = $$-\tfrac{3}{4}$$, the number of iterations required increases with a small ε. It turns out that multiplying the value of ε with the number of iterations required yields an approximation of π that becomes better for smaller ε. For example, for ε = 0.0000001 the number of iterations is 31415928 and the product is 3.1415928.

shrub
"what emerges from Myrrberg-Feigenbaum point is what we denominate a shrub due to its shape" M Romera

Wake
p/q-wake is the region of parameter plane enclosed by two external rays landing on the same root point on the boundary of main cardioid ( period 1 hyperbolic component).

Angles of the external rays that land on the root point one can find by :
 * Combinatorial algorithm = Devaney's method
 * book program by Claude Heiland-Allen
 * wake function from program Mandel by Wolf Jung

p/q-Subwake of W is a wake of a p/q-satellite component of W



wake is named after:
 * rotation number p/q ( as above)
 * angles of external rays landing in it's root point : "If two M-rays $$R_M(\theta \pm)$$ land at the same point $$c_0$$ we denote by wake $$(\theta \pm)$$ the component of $$\mathbb{C} \setminus R_M(\theta +) \cup R_M(\theta -) \cup \{c_0\}$$ which does not contain 0."

Components of dynamical plane
In case of Siegel disc critical orbit is a boundary of component containing Siegel Disc.

For a quadratic polynomial with a parabolic orbit, the unique Fatou component containing the critical value will be called the characteristic Fatou component; (Dierk Schleicher in Rational Parameter Rays of the Mandelbrot Set )

Domain
Domain in mathematical analysis it is an open connected set

Jordan domain
"A Jordan domain J is the homeomorphic image of a closed disk in E2. The image of the boundary circle is a Jordan curve, which by the Jordan Curve Theorem separates the plane into two open domains, one bounded, the other not, such that the curve is the boundary of each."

Dwell bands
"Dwell bands are regions where the integer iteration count is constant, when the iteration count decreases (increases) by 1 then you have passed a dwell band going outwards (inwards). " Other names:
 * level sets of integer escape time

Flower
Lea-Fatu flower

Interval
a partition of an interval into subintervals
 * Markov paritition

Invariant
sth is invariant if it does't change under transformation

"A subset S of the domain Ω is an invariant set for the system (7.1) if the orbit through a point of S remains in S for all t ∈ R. If the orbit remains in S for t > 0, then S will be said to be positively invariant. Related definitions of sets that are negatively invariant, or locally invariant, can easily be given"

Examples :
 * invariant set
 * invariant point = fixed point
 * invariant cycle = periodic point
 * invariant curve
 * invariant circle
 * petal = invariant planar set

Level set

 * a level set of a real-valued function f ( see also dwell band)
 * Level set methods (LSM)
 * on the dynamic plane

in case of :
 * dynamic plane
 * integer escape time
 * target set : exterior of the circle ( used in the escaping test )

level set is defined :

$$L_n= \{z_0 : abs(z_{n-1}) < ER < abs(z_n) \} \,$$

Boundaries of level sets ( lemniscates) are

$$B_n= \{z_0: abs(z_{n-1}) = ER \} \,$$

Cantor
The Cantor locus is the unique hyperbolic component, in the moduli space of quadratic rational maps rat2, consisting of maps with totally disconnected Julia sets

Connectedness
In one-dimensional complex dynamics, the connectedness locus is a subset of the parameter space of rational functions, which consists of those parameters for which the corresponding Julia set is connected. the Mandelbrot set is a subset of the complex plane that may be characterized as the connectedness locus of a family of polynomial maps.

Planar set
a non-separating planar set is a set whose complement in the plane is connected.

post-critical
"For a rational map of the Riemann sphere f, the post-critical set PC(f) is defined as closure of orbits of all critical points of f. It is proved by Lyubich [Ly83b] that the post-critical set of a rational map is the measure theoretic attractor of points in the Julia set of that map. That is, for every neighborhood of the post-critical set, orbit of almost every point in the Julia set eventually stays in that neighborhood"

region

 * Shell-Thron region

Sepal
Sepal

Elliptic case
For the elliptic dynamics, when there is a Siegel disc, the target set is an inner circle

Hyperbolic case
Infinity is allways hyperbolic attractor for forward iteration of polynomials. Target set here is an exterior of any shape containing all point of Julia set ( and it's interior). There are also other hyperbolic attractors.

In case of forward iteration target set $$T\,$$ is an arbitrary set on dynamical plane containing infinity and not containing points of filled Julia set.

For escape time algorithms target set determines the shape of level sets and curves. It does not do it for other methods.

Exterior of circle
This is typical target set. It is exterior of circle with center at origin $$z = 0 \,$$ and radius =ER :

$$T_{ER}=\{z:abs(z) > ER \} \,$$

Radius is named escape radius ( ER ) or bailout value.

Circle of radius=ER centered at the origin is : $$ \{z:abs(z) = ER \} \,$$

Exterior of square
Here target set is exterior of square of side length $$s\, $$ centered at origin

$$T_s=\{z: abs(re(z)) > s \mbox{or}  abs(im(z))>s \} \,$$

Parabolic case : petal
In the parabolic case target set shoul be iside petal

Trap
Trap is another name of the target set. It is a set which captures any orbit tending to point inside the trap ( fixed / periodic point ).

=Test=

Bailout test or escaping test


It is used to check if point z on dynamical plane is escaping to infinity or not. It allows to find 2 sets :
 * escaping points ( it should be also the whole basing of attraction to infinity)
 * not escaping points ( it should be the complement of basing of attraction to infinity)

In practice for given IterationMax and Escape Radius :
 * some pixels from set of not escaping points may contain points that escape after more iterations then IterationMax ( increase IterMax )
 * some pixels from escaping set may contain points from thin filaments not choosed by maping from integer to world ( use DEM )

If $$z_n$$ is in the target set $$T\,$$ then $$z_0$$ is escaping to infinity ( bailouts ) after n forward iterations ( steps).

The output of test can be :
 * boolean ( yes/no)
 * integer : integer number (value of the last iteration)

Types of bailout test:
 * in Fractalzoom
 * other description

Attraction test
=Theorem=
 * The Douady-Hubbard landing theorem for periodic external rays of polynomial dynamics: "for a complex polynomial f with bounded postcritical set, every periodic external ray lands at a repelling or parabolic periodic point, and conversely every repelling or parabolic point is the landing point of at least one periodic external ray."

=References=