This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Mandelbrot set and Julia sets of fractional order

Marius-F. Danca
STAR-UBB Institute,
Babes-Bolyai University,
400084, Cluj-Napoca, Romania
and
Romanian Institute of Science and Technology,
400487, Cluj-Napoca, Romania
[email protected]
and
Michal Fečkan
Faculty of Mathematics, Physics and Informatics,
Comenius University in Bratislava,
84215 Bratislava, Slovakia
and
Mathematical Institute, Slovak Academy of Sciences,
84104 Bratislava, Slovakia
[email protected]
Abstract

In this paper the fractional-order Mandelbrot and Julia sets in the sense of qq-th Caputo-like discrete fractional differences, for q(0,1)q\in(0,1), are introduced and several properties are analytically and numerically studied. Some intriguing properties of the fractional models are revealed. Thus, for q1q\uparrow 1, contrary to expectations, it is not obtained the known shape of the Mandelbrot of integer order, but for q0q\downarrow 0. Also, we conjecture that for q0q\downarrow 0, the fractional-order Mandelbrot set is similar to the integer-order Mandelbrot set, while for q0q\downarrow 0 and c=0c=0, one of the underlying fractional-order Julia sets is similar to the integer-order Mandelbrot set. In support of our conjecture, several extensive numerical experiments were done. To draw the Mandelbrot and Julia sets of fractional order, the numerical integral of the underlying initial values problem of fractional order is used, while to draw the sets, the escape-time algorithm adapted for the fractional-order case is used. The algorithm is presented as pseudocode.

keywords: Mandelbrot set of fractional order; Julia set of fractional order; Caputo-like discrete fractional difference

1 Introduction

The study of the dynamics of complex maps was initiated by P. Fatou and G. Julia in the early of twentieth century, before being revived by B. Mandelbrot. As know, in the complex plane \mathbb{C}, the Integer Order (IO) Mandelbrot set represents the set of complex numbers (parameters) cc for which the quadratic map fc(z)=z2+cf_{c}(z)=z^{2}+c (Mandelbrot map) does not diverge to infinity when it is iterated with fcf_{c} from z=0z=0. This set, has been first defined and drawn by Robert W. Brooks and Peter Matelski in 1978 [1], and later made famous by Benoit Mandelbrot (see e.g. [2]). The dynamics generates by fcf_{c} represent a huge sources of fractal structures (see e.g. [3, 4, 5, 6]).

Julia sets are made of all points which under iterations do not go to an attractor which may be at infinity. Compared to Mandelbrot set, where cc is variable in the parametric plane \mathbb{C}, Julia sets are obtained for fixed cc and the origin of iterations variable in \mathbb{C}.

The Mandelbrot set is known as the set of all points cc for which Julia sets are compact and connected.

Details and background on Mandelbrot set and Julia sets can be found in the following works [2, 7, 8, 9, 10, 3, 11], to cite only few of them.

Due the description of memory and hereditary properties, Fractional Order (FO) difference equations still receive increasing attention. However, as mentioned in [12], overall, fractional calculus, closely related to classical calculus, is not direct generalization of classical calculus in the sense of rigorous mathematics. One of the first definitions of a fractional difference operator has been proposed in 1974 [13]. While there are many works on fractional differential equations, there still are only few works in the theory of the fractional finite difference equations. In [14, 15, 16] problems related to Caputo fractional sums and differences can be found, while in [29] Initial Value Problems (IVPs) in fractional differences are studied. For stability of fractional differences compare [17, 18], while properties of fractional discrete logistic map, weakly fractional difference equations, symmetry-breaking of fractional maps can be found in [19, 20, 21]. The nonexistence of periodic solutions in fractional difference equations is analyzed in [22].

Notations utilized in this paper:

  • IOIO\mathcal{M}: Mandelbrot of IO;

  • IO𝒦cIO\mathcal{K}_{c}: Filled Julia set of IO;

  • IO𝒥cIO\mathcal{J}_{c}: Julia set of IO;

  • FOFO\mathcal{M}: Mandelbrot set of FO;

  • FO𝒦cFO\mathcal{K}_{c}: Filled Julia set of FO;

  • DEM: Distance Estimator Method;

  • IIM: Inverse Iteration Method

2 Mandelbrot set and Julia sets of integer order

In this section, few of the most important characteristics of IOIO\mathcal{M} set, and IO𝒦cIO\mathcal{K}_{c} sets, which will be revealed analytically or numerically in the cases of Mandelbrot and Julia sets of FO, are briefly presented.

The iteration of fcf_{c} is obtained by the relation

zn=zn12+c,z0=0,n={1,2,},z_{n}=z_{n-1}^{2}+c,z_{0}=0,n\in\mathbb{N}^{*}=\{1,2,...\}, (1)

which generates the sequence

z0=0,z1=fc(0)=c,z2=fc2(0)=c2+c,z3=fc3(0)=(c2+c)2+c,z_{0}=0,z_{1}=f_{c}(0)=c,z_{2}=f_{c}^{2}(0)=c^{2}+c,z_{3}=f_{c}^{3}(0)=(c^{2}+c)^{2}+c,... (2)

where by fck(0)f_{c}^{k}(0) one understands fc(fck1(0))f_{c}(f_{c}^{k-1}(0)).

A complex number cIOc\in IO\mathcal{M} set if the absolute value of znz_{n} in the sequence (2) remains bounded for all nn\in\mathbb{N}^{*}, |zn|<2|z_{n}|<2, for all n0n\geq 0.

As proposed by Mandelbrot, the boundary of the Mandelbrot set represents a fractal curve (Fig. 1 (a)). For the history related to the origin of the IOIO\mathcal{M} set compare [23].

Consider the set of all points z0z_{0} which tend to \infty through the iteration (1)

Ac()={z0:fck(z0), as k}.A_{c}(\infty)=\{z_{0}\in\mathbb{C}:f_{c}^{k}(z_{0})\rightarrow\infty,\text{~{}as~{}}k\rightarrow\infty\}.

The set Ac()A_{c}(\infty) depends on cc, and his frontier represents the IO𝒥cIO\mathcal{J}_{c} set of fcf_{c}.

The filled Julia set for fixed cc, of IO, related to fcf_{c}, IO𝒦cIO\mathcal{K}_{c} which, for computationally reasons is considered in this paper, is the set of all points z0z_{0}\in\mathbb{C} for which the orbit (2) is bounded

IO𝒦c=\Ac()={z0:fck(z0) remains bounded for all k}.IO\mathcal{K}_{c}=\mathbb{C}\backslash A_{c}(\infty)=\{z_{0}\in\mathbb{C}:f_{c}^{k}(z_{0})\text{~{}~{}remains bounded for all~{}}k\}.

The IO𝒥cIO\mathcal{J}_{c} set is contained in the IO𝒦cIO\mathcal{K}_{c} set and is the boundary of the IO𝒦cIO\mathcal{K}_{c} set

IO𝒦c=IO𝒥c=Ac().\partial IO\mathcal{K}_{c}=IO\mathcal{J}_{c}=\partial A_{c}(\infty).

In this paper, beside some new properties related to the Mandelbrot set of FO, the following known properties of Mandelbrot set and Julia sets of IO will be analytically or numerically studied on their FO counterparts.

  1. 1.

    The IO𝒦cIO\mathcal{K}_{c} sets for purely real cc, and IOIO\mathcal{M} set, are symmetric about the real axis (reflection symmetry). Julia sets of fcf_{c} are symmetric about the origin.

  2. 2.

    As known, it is conjectured that the Mandelbrot set is locally connected [7, 23], the full conjecture of this very technical and complicated property being still open. Mandelbrot had decided empirically that his isolated islands were actually connected to the mainland by very thin filaments [24]. In this paper we are interested in the connectivity property as a computationally property which by using, beside the escape-time algorithm (see Appendix A), a performing method (Distance Estimator Method), revel the filaments connecting the apparently isolated islands to the mainland of the Mandelbrot set or Julia sets, of IO or FO. Empirical small areas are considered.

  3. 3.

    The IOIO\mathcal{M} set is the set of all parameters cc for which IO𝒦cIO\mathcal{K}_{c} are connected sets;

  4. 4.

    The FOFO\mathcal{M} set is bounded;

  5. 5.

    For cc situated outside of IOIO\mathcal{M} one obtains Cantor sets (“dust” sets composed of infinitely disjoint points);

  6. 6.

    The Julia sets can be connected, disconnected or totally disconnected (see e.g. [25, 26, 27]). To note that the IOIO\mathcal{M} set represents the set of all points in the complex plane for which the alternated Julia sets [28] are disconnected (but not totally disconnected).

In this paper the filled Julia sets are considered.

Hereafter, by point in the complex plane, one understands the image in the complex plane of a complex number.

Drawing Mandelbrot set and Julia sets of IO and FO, bases on the theorem which states that iterating fcf_{c}, with starting value z0z_{0}, only one of the following possibilities happens: either the obtained orbit remains bounded by 22, or diverges to \infty [5].

In Fig. 1 (a) is presented the IOIO\mathcal{M} set, while in Figs. 1 (c)-(j) there are presented several IO𝒦cIO\mathcal{K}_{c} sets for different cc values. In Fig. 1 (c), there is presented an IO𝒥cIO\mathcal{J}_{c} set with no interior, with c=0.359+ı0.599c=0.359+\i 0.599, while in Fig.1 (d) there are presented comparatively, both the IO𝒦cIO\mathcal{K}_{c} and IO𝒥cIO\mathcal{J}_{c} sets for the same value of parameter c=0.276+ı0.536c=0.276+\i 0.536, obtained with the time-escape algorithm and IIM, [5], respectively.

3 Fractional Order Mandelbrot map

In this section the fractional discretization of the Mandelbrot and Julia sets of FO, in the sense of Caputo-like are introduced.

To obtain the fractional discretization of the FOFO\mathcal{M}, consider the time scale Na={a,a+1,a+2,}N_{a}=\{a,a+1,a+2,...\}. For q>0q>0 and qq\not\in\mathbb{N} the qq-th Caputo-like discrete fractional difference of a function u:Nau:N_{a}\rightarrow\mathbb{R} is defined as is defined [29, 30] as

Δaqu(t)=Δa(nq)Δnu(t)=1Γ(nq)s=at(nq)(ts1)(nq1)Δnu(s),\Delta_{a}^{q}u(t)=\Delta_{a}^{-(n-q)}\Delta^{n}u(t)=\frac{1}{\Gamma(n-q)}\sum_{s=a}^{t-(n-q)}(t-s-1)^{(n-q-1)}\Delta^{n}u(s), (3)

for tNa+nqt\in N_{a+n-q} and n=[q]+1n=[q]+1.

Δn\Delta^{n} is the nn-th order forward difference operator,

Δnu(s)=k=0n(nk)(1)nku(s+k),\Delta^{n}u(s)=\sum_{k=0}^{n}\binom{n}{k}(-1)^{n-k}u(s+k),

while Δaq\Delta_{a}^{-q} represents the fractional sum of order qq of uu, namely,

Δaqu(t)=1Γ(q)s=atq(ts1)(q1)u(s),ta+q,\Delta_{a}^{-q}u(t)=\frac{1}{\Gamma(q)}\sum_{s=a}^{t-q}(t-s-1)^{(q-1)}u(s),~{}t\in\mathbb{N}_{a+q},

with the falling factorial t(q)t^{(q)} in the following form:

t(q)=Γ(t+1)Γ(tq+1).t^{(q)}=\frac{\Gamma(t+1)}{\Gamma(t-q+1)}.

The fractional operator Δaq\Delta_{a}^{-q} maps functions defined on a\mathbb{N}_{a} to functions on Na+qN_{a+q} (for time scales see, e.g., [31]).

For the case considered in this paper, q(0,1)q\in(0,1), when Δu(s)=u(s+1)u(s)\Delta u(s)=u(s+1)-u(s), n=1n=1, and starting point a=0a=0, qq-th Caputo’s fractional derivative, Δq\Delta^{q}, becomes

Δqu(t)=1Γ(1q)s=at(1q)(ts1)(q)Δu(s).\Delta^{q}u(t)=\frac{1}{\Gamma(1-q)}\sum_{s=a}^{t-(1-q)}(t-s-1)^{(-q)}\Delta u(s). (4)

Consider next, the FO autonomous IVP in the sense of Caputo’s derivative

Δqu(t)=f(u(t+q1)),t1q,u(0)=u0,\Delta^{q}u(t)=f(u(t+q-1)),~{}~{}t\in\mathbb{N}_{1-q},~{}~{}u(0)=u_{0}, (5)

with ff a continuous real valued map and q(0,1)q\in(0,1). The numerical solution is

u(t)=u0+1Γ(q)s=1qtq(ts1)(q1)f(u(s+q1)),u(t)=u_{0}+\frac{1}{\Gamma(q)}\sum_{s=1-q}^{t-q}(t-s-1)^{(q-1)}f(u(s+q-1)), (6)

or, in the convenient form for numerical simulation [21]

u(n)=u(0)+1Γ(q)i=1nΓ(ni+q)Γ(ni+1)f(u(i1)),n.u(n)=u(0)+\frac{1}{\Gamma(q)}\sum_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}f(u(i-1)),~{}{n\in\mathbb{N}^{*}}. (7)

The recursive iteration implies that (7) is equivalent to the IVP (5) [29] and, therefore, the study of the IVP (5) can be realized, both analytically and numerically, on (7).

Consider next, the following FO variant of (5), in the sense of Caputo’s fractional derivative (4)

Δqz(t)=f(z(t+q1),tN1q,z(0)=z0,\Delta^{q}z(t)=f(z(t+q-1),~{}~{}t\in N_{1-q},~{}~{}z(0)=z_{0}, (8)

with ff a complex continuous function of variable z=x+ıyz=x+\i y\in\mathbb{C} and z0z_{0}\in\mathbb{C}. Then, the numerical integral (7) of the IVP (8) becomes

z(n)=z(0)+1Γ(q)i=1nΓ(ni+q)Γ(ni+1)f(z(i1)),n.z(n)=z(0)+\frac{1}{\Gamma(q)}\sum_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}f(z(i-1)),~{}{n\in\mathbb{N}^{*}}. (9)

If one consider the FO variant of the IVP (1), with scaled cc within a parametric complex domain, z(0)=0z(0)=0, one obtains the numerical integral defining the FOFO\mathcal{M} map

FO:z(n)=1Γ(q)i=1nΓ(ni+q)Γ(ni+1)fc(z(i1)),n,FO\mathcal{M}:~{}~{}z(n)=\frac{1}{\Gamma(q)}\sum_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}f_{c}(z(i-1)),~{}{n\in\mathbb{N}^{*}}, (10)

To facilitate understanding the numerical implementation of (10), with (fc(z))=x2y2+cx\Re(f_{c}(z))=x^{2}-y^{2}+c_{x}, (fc(z))=2xy+cy\Im(f_{c}(z))=2xy+c_{y}, one gets the following scalar form

x(n)=1Γ(q)i=1nΓ(ni+q)Γ(ni+1)(x(i1)2y(i1)2+cx),y(n)=1Γ(q)i=1nΓ(ni+q)Γ(ni+1)(2x(i1)y(i1)+cy),n,\large\begin{array}[]{l}x(n)=\frac{1}{\Gamma(q)}{\sum}_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}(x(i-1)^{2}-y(i-1)^{2}+c_{x}),\\ \\[2.84526pt] y(n)=\frac{1}{\Gamma(q)}{\sum}_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}(2x(i-1)y(i-1)+c_{y}),~{}{n\in\mathbb{N}^{*}},\end{array} (11)

where x(0)=y(0)=0x(0)=y(0)=0.

If z(0)z(0) is variable within a complex domain and cc is fixed, one obtains the integral defining the FO𝒦cFO\mathcal{K}_{c} sets

FO𝒦c:z(n)=z(0)+1Γ(q)i=1nΓ(ni+q)Γ(ni+1)fc(z(i1)),n.FO\mathcal{K}_{c}:~{}~{}z(n)=z(0)+\frac{1}{\Gamma(q)}\sum_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}f_{c}(z(i-1)),~{}{n\in\mathbb{N}^{*}}. (12)

The scalar form of (12) is

x(n)=x(0)+1Γ(q)i=1nΓ(ni+q)Γ(ni+1)(x(i1)2y(i1)2+cx),y(n)=y(0)+1Γ(q)i=1nΓ(ni+q)Γ(ni+1)(2x(i1)y(i1)+cy),n,\large\begin{array}[]{l}x(n)=x(0)+\frac{1}{\Gamma(q)}{\sum}_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}(x(i-1)^{2}-y(i-1)^{2}+c_{x}),\\ \\[0.28436pt] y(n)=y(0)+\frac{1}{\Gamma(q)}{\sum}_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}(2x(i-1)y(i-1)+c_{y}),~{}{n\in\mathbb{N}^{*}},\end{array} (13)

Note that for the FO𝒦cFO\mathcal{K}_{c} sets, z(0)z(0) (i.e. x(0)x(0), and y(0)y(0) in (12) and (13) are variable and scan a complex domain of the variable z(0)z(0) (see variables xxxx and yyyy in Algorithm 2, Appendix A).

4 Properties of the FOFO\mathcal{M} map

If cc\inFOFO\mathcal{M}, the orbits generating by (10) are bounded111Boundedness property of FOFO\mathcal{M} for cc\in\mathbb{C} is not analyzed here (The proof, for cc\in\mathbb{R}, is presented in Proposition 5).. Then

z(n)¯=1Γ(q)i=1nΓ(ni+q)Γ(ni+1)(z(i1)¯2+c¯),\overline{z(n)}=\frac{1}{\Gamma(q)}\sum_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}(\overline{z(i-1)}^{2}+\overline{c}),

with |z(n)¯|=|z(n)||\overline{z(n)}|=|z(n)|, so if cc\inFOFO\mathcal{M} then also c¯\overline{c}\inFOFO\mathcal{M}.

Thus, one finds the known property of the IOIO\mathcal{M} set

Proposition 1

FOFO\mathcal{M} set is symmetric about the real axis.

Also, for cc purely real, following the same reasoning, because c¯=c\overline{c}=c, like for IO𝒦cIO\mathcal{K}_{c} sets, one has the following property

Proposition 2

For cc\in\mathbb{R}, the FO𝒦cFO\mathcal{K}_{c} sets are symmetric with respect the real axis.

Next, for cc\in\mathbb{R} one has

z(n)=1Γ(q)i=1nΓ(ni+q)Γ(ni+1)(z(i1)2+c)cΓ(q)i=1nΓ(ni+q)Γ(ni+1)z(n)=\frac{1}{\Gamma(q)}\sum_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}(z(i-1)^{2}+c)\geq\frac{c}{\Gamma(q)}\sum_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}

Using

nq1qi=1nΓ(ni+q)Γ(ni+1)nq+1q,n=1,2,\frac{n^{q}-1}{q}\leq\sum_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}\leq\frac{n^{q}+1}{q},~{}~{}n=1,2,... (14)

one obtains for c>0c>0

z(n)cΓ(q)nq1q+n+.z(n)\geq\frac{c}{\Gamma(q)}\frac{n^{q}-1}{q}\to+\infty\quad n\to+\infty.

Thus, we get

Proposition 3

For any cc\in\mathbb{R}, c>0c>0, cc\notinFOFO\mathcal{M} set.

Property 3 is verified numerically too as indicated by the light blue line AB where cRc\in R and c>0c>0, and cc\notin FOFO\mathcal{M} set in Fig. 3 (a) for q=1q=1 and also Fig. 5 (a) for q=0.5q=0.5.

Furthermore, for cc\in\mathbb{R} and c<0c<0, one obtains

z(0)=0,z(1)=1Γ(q)Γ(11+q)Γ(11+1)(z(0)2+c)=c,z(2)=1Γ(q)(Γ(21+q)Γ(21+1)(z(0)2+c)+Γ(22+q)Γ(22+1)(z(1)2+c))=1Γ(q)(Γ(1+q)Γ(2)c+Γ(q)Γ(1)(c2+c))=qc+c2+c=c2+(1+q)c.\begin{gathered}z(0)=0,\\ z(1)=\frac{1}{\Gamma(q)}\frac{\Gamma(1-1+q)}{\Gamma(1-1+1)}(z(0)^{2}+c)=c,\\ z(2)=\frac{1}{\Gamma(q)}\left(\frac{\Gamma(2-1+q)}{\Gamma(2-1+1)}(z(0)^{2}+c)+\frac{\Gamma(2-2+q)}{\Gamma(2-2+1)}(z(1)^{2}+c)\right)\\ =\frac{1}{\Gamma(q)}\left(\frac{\Gamma(1+q)}{\Gamma(2)}c+\frac{\Gamma(q)}{\Gamma(1)}(c^{2}+c)\right)=qc+c^{2}+c=c^{2}+(1+q)c.$$\end{gathered}

Assuming

c(1+q),c\leq-(1+q), (15)

one obtains z(2)0z(2)\geq 0.

Suppose

z(k)0,k=2,,n1,fc(z(k))δ,k=1,,n1,\begin{gathered}z(k)\geq 0,\quad k=2,\cdots,n-1,\\ f_{c}(z(k))\geq\delta,\quad k=1,\cdots,n-1,\end{gathered}

for δ>0\delta>0 specified latter, and an n2n\geq 2. Then

δfc(z(1))=z2+c.\delta\leq f_{c}(z(1))=z^{2}+c. (16)

Next

z(n)=1Γ(q)(Γ(n1+q)Γ(n1+1)fc(z(0))+i=2n1Γ(ni+q)Γ(ni+1)fc(z(i1))+Γ(nn+q)Γ(nn+1)fc(z(n1))1Γ(q)(Γ(n1+q)Γ(n)c+Γ(q)Γ(1)δ)cΓ(q)+δ.\begin{gathered}z(n)=\frac{1}{\Gamma(q)}\Big{(}\frac{\Gamma(n-1+q)}{\Gamma(n-1+1)}f_{c}(z(0))+\sum_{i=2}^{n-1}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}f_{c}(z(i-1))\\ +\frac{\Gamma(n-n+q)}{\Gamma(n-n+1)}f_{c}(z(n-1)\Big{)}\geq\frac{1}{\Gamma(q)}\Big{(}\frac{\Gamma(n-1+q)}{\Gamma(n)}c+\frac{\Gamma(q)}{\Gamma(1)}\delta\Big{)}\geq\frac{c}{\Gamma(q)}+\delta.\end{gathered}

If

δcΓ(q),\delta\geq-\frac{c}{\Gamma(q)}, (17)

one obtains z(n)cΓ(q)+δ0z(n)\geq\frac{c}{\Gamma(q)}+\delta\geq 0.

Finally, consider

fc(z(n))f(cΓ(q)+δ)=(cΓ(q)+δ)2+c.f_{c}(z(n))\geq f\left(\frac{c}{\Gamma(q)}+\delta\right)=\left(\frac{c}{\Gamma(q)}+\delta\right)^{2}+c.

Assuming

(cΓ(q)+δ)2+cδ,\left(\frac{c}{\Gamma(q)}+\delta\right)^{2}+c\geq\delta, (18)

one obtains fc(z(n))δf_{c}(z(n))\geq\delta.

If in (17) one takes

δ=2cΓ(q),\delta=-\frac{2c}{\Gamma(q)}, (19)

inserting (19) into (16) and (18), one obtains

c2+c2cΓ(q)(cΓ(q)2cΓ(q))2+c2cΓ(q),c^{2}+c\geq-\frac{2c}{\Gamma(q)}\quad\wedge\quad\left(\frac{c}{\Gamma(q)}-\frac{2c}{\Gamma(q)}\right)^{2}+c\geq-\frac{2c}{\Gamma(q)},

which is equivalent to

cΓ(q)+2Γ(q)c(Γ(q)+2)Γ(q).c\leq-\frac{\Gamma(q)+2}{\Gamma(q)}\quad\wedge\quad c\leq-(\Gamma(q)+2)\Gamma(q).

Using Γ(q)1\Gamma(q)\geq 1, the following relations are obtained

(Γ(q)+2)Γ(q)(1+q)(Γ(q)+2)Γ(q)Γ(q)+2Γ(q).-(\Gamma(q)+2)\Gamma(q)\leq-(1+q)\quad\wedge\quad-(\Gamma(q)+2)\Gamma(q)\leq-\frac{\Gamma(q)+2}{\Gamma(q)}.

Summarizing, if

c(Γ(q)+2)Γ(q),c\leq-(\Gamma(q)+2)\Gamma(q), (20)

then equalities (15), (17) and (18) hold with (19), and applying the mathematical induction principle, one obtain

z(n)0,n2,fc(z(n))2cΓ(q),n.\begin{gathered}z(n)\geq 0,\quad\forall n\geq 2,\\ f_{c}(z(n))\geq-\frac{2c}{\Gamma(q)},\quad\forall n\in\mathbb{N}.\end{gathered}

For n2n\geq 2, these estimates along with (14) allow to derive

z(n)=1Γ(q)(Γ(n1+q)Γ(n1+1)fc(z(0))+i=2nΓ(ni+q)Γ(ni+1)fc(z(i1)))1Γ(q)(Γ(n1+q)Γ(n)c2cΓ(q)i=2nΓ(ni+q)Γ(ni+1))=1Γ(q)(Γ(n1+q)Γ(n)(c+2cΓ(q))2cΓ(q)i=1nΓ(ni+q)Γ(ni+1))1Γ(q)(c+2cΓ(q))2cΓ(q)nq1q+,\begin{gathered}z(n)=\frac{1}{\Gamma(q)}\Big{(}\frac{\Gamma(n-1+q)}{\Gamma(n-1+1)}f_{c}(z(0))+\sum_{i=2}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}f_{c}(z(i-1))\Big{)}\\ \geq\frac{1}{\Gamma(q)}\Big{(}\frac{\Gamma(n-1+q)}{\Gamma(n)}c-\frac{2c}{\Gamma(q)}\sum_{i=2}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}\Big{)}\\ =\frac{1}{\Gamma(q)}\Big{(}\frac{\Gamma(n-1+q)}{\Gamma(n)}\left(c+\frac{2c}{\Gamma(q)}\right)-\frac{2c}{\Gamma(q)}\sum_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}\Big{)}\\ \geq\frac{1}{\Gamma(q)}\left(c+\frac{2c}{\Gamma(q)}\right)-\frac{2c}{\Gamma(q)}\frac{n^{q}-1}{q}\to+\infty,\end{gathered}

as n+n\to+\infty. The above arguments lead to the next result.

Proposition 4

For any cc\in\mathbb{R} and c<0c<0, satisfying (20), cc\notinFOFO\mathcal{M}.

From Propositions 3 and 4 one can deduce the boundedness of the FOFO\mathcal{M} for real cc.

Proposition 5

FOFO\mathcal{M} [(Γ(q)+2)Γ(q),0)\bigcap\mathbb{R}\subset\Big{[}(-\Gamma(q)+2)\Gamma(q),0\Big{)}, i.e., the real part of FOFO\mathcal{M} set is a bounded subset of \mathbb{R}.

Remark 6

Considering the coefficients 1Γ(q)Γ(ni+q)Γ(ni+1)\frac{1}{\Gamma(q)}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}, nn\in\mathbb{N}^{*}, clearly one obtains

limq11Γ(q)Γ(ni+q)Γ(ni+1)=1.\lim_{q\to 1}\frac{1}{\Gamma(q)}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}=1.

Thus letting q1q\to 1 in (9), we get

u(n)=u(0)+i=1nf(u(i1)),n,u(n)=u(0)+\sum_{i=1}^{n}f(u(i-1)),~{}~{}n\in\mathbb{N}, (21)

which corresponds to iteration of a map uu+f(u)u\to u+f(u). Furthermore,

1Γ(q)Γ(ni+q)Γ(ni+1)=1.\frac{1}{\Gamma(q)}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}=1.

For i=ni=n, while for i<ni<n, we have

limq01Γ(q)Γ(ni+q)Γ(ni+1)=limq01Γ(q)limq0Γ(ni+q)Γ(ni+1)=01ni=0.\lim_{q\to 0}\frac{1}{\Gamma(q)}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}=\lim_{q\to 0}\frac{1}{\Gamma(q)}\lim_{q\to 0}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}=0\frac{1}{n-i}=0.

Thus letting q0q\to 0 in (9), we get

u(n)=u(0)+f(u(n1)),n,u(n)=u(0)+f(u(n-1)),~{}~{}n\in\mathbb{N}, (22)

which corresponds to iteration of a map uf(u)u\to f(u) only if u(0)=0u(0)=0 and, in general, it gives different iterations. Of course this holds just for finite/bounded times of iterations. Indeed, if f(u)=1f(u)=1 for any uu, from (9) one obtains

u(n)=u(0)+1Γ(q)i=1nΓ(ni+q)Γ(ni+1)nqq,n+.u(n)=u(0)+\frac{1}{\Gamma(q)}\sum_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}\sim\frac{n^{q}}{q},\quad n\to+\infty.

So the iterations do depend on qq on \mathbb{N}.

If the IVP (8) is considered in the sense of FOFO\mathcal{M} map (with scanning cc and z(0)=0z(0)=0), for q1q\uparrow 1,the numerical integral (21) becomes

z(n)=i=1nfc(z(i1)),n,z(n)=\sum_{i=1}^{n}f_{c}(z(i-1)),n\in\mathbb{N}, (23)

while for q0q\downarrow 0

z(n)=fc(z(n1)),n.z(n)=f_{c}(z(n-1)),~{}n\in\mathbb{N}. (24)

If the IVP (8) is considered in the sense of FO𝒦cFO\mathcal{K}_{c} sets (with scanning z(0)z(0) and fixed cc), for q1q\uparrow 1, the numerical integral (21) becomes

z(n)=z(0)+i=1nfc(u(i1)),n,z(n)=z(0)+\sum_{i=1}^{n}f_{c}(u(i-1)),~{}~{}n\in\mathbb{N}, (25)

while for q0q\downarrow 0

z(n)=z(0)+fc(z(n1)),n.z(n)=z(0)+f_{c}(z(n-1)),~{}~{}n\in\mathbb{N}. (26)

Propositions 4 and 5 are verified numerically as well. Thus, for q=0.5q=0.5, from (20) one gets c<6.6865c<-6.6865, values for which FOFO\mathcal{M} does not exists (see Fig. 5 (a), wherefrom one can see that the projection of the FOFO\mathcal{M} on the real axis is included in the segment (6.6868,0)(-6.6868,0). These properties are verified also for the case q1q\uparrow 1, when one gets c<3c<-3, and where the FOFO\mathcal{M} set does not exists and the projection of the FOFO\mathcal{M} on the real is contained in the segment (3,0)(-3,0) (Fig. 3 (a)).

Remark 7

Studying the dynamics of the case q=0q=0 in general is challenging task. For instance, consider the general relation

z(n)=z(0)+az(n1),n.z(n)=z(0)+az(n-1),~{}~{}n\in\mathbb{N}. (27)

for 0a0\neq a\in\mathbb{C} and zz\in\mathbb{C}. Then

z(n)=z(0)(1+a++an).z(n)=z(0)(1+a+\cdots+a^{n}).

Thus if |a|>1|a|>1 then limnu(n)=\lim_{n\to\infty}u(n)=\infty. If |a|<1|a|<1, then limnz(n)=z(0)1a\lim_{n\to\infty}z(n)=\frac{z(0)}{1-a}. The relation (27) has the only equilibrium 0, so the limit point z(0)1a\frac{z(0)}{1-a} is not an equilibrium of (27). Next, taking z~(0)=z(0)1a\tilde{z}(0)=\frac{z(0)}{1-a}, we get the new limit point z(0)(1a)2\frac{z(0)}{(1-a)^{2}}, and repeating this procedure, we get a sequence of limit points {z(0)(1a)k}k=1\{\frac{z(0)}{(1-a)^{k}}\}_{k=1}^{\infty}. If |1a|<1|1-a|<1 then this sequence tends to \infty. If |1a|=1|1-a|=1 then this sequence oscillates on the unit circle S1S^{1}. If |1a|>1|1-a|>1 then this sequence tends to 0.

One can see that the dynamics of (27) for 0|a|<10\neq|a|<1 is much more complicated then for the standard linear map uauu\to au.

5 Numerical approach of FOFO\mathcal{M} set and FO𝒦cFO\mathcal{K}_{c} sets

FOFO\mathcal{M} set and FO𝒦cFO\mathcal{K}_{c} sets are generated with the escape-time algorithm adapted to complex FO discrete equations and is presented in Appendix A.

In (10), numerically, qq can take the limit value 1 (see Remark 6)). Therefore, hereafter, the limit case q1q\uparrow 1 will be considered q=1q=1.

Regarding the other limit case, q0q\downarrow 0, due to the fact Γ(0)\Gamma(0) is not defined and the limit is considered on small intervals, in this paper for numerically reasons, the limit has been considered empirically, as q=1e15q=1e-15, and will be denoted 0+0_{+}.

Remark 8

Numerically, the relations (10) with (23) or (24) (for q1q\uparrow 1 and qq\downarrow, respectively) are similar. Also, the relations (12) with (25) or (26) (for q1q\uparrow 1 and qq\downarrow, respectively) are similar.

For q0q\downarrow 0, linked to Remark 6, one get numerically the following important identity properties (congruent-like shapes) which, for now, are introduced as conjectures

Conjecture 1

For q0q\downarrow 0, FOFO\mathcal{M} =IOIO\mathcal{M}. (Fig. 4 (a)).

Conjecture 2

For q0q\downarrow 0, and c=0c=0, FO𝒦cFO\mathcal{K}_{c} =IOIO\mathcal{M}. (Fig. 4 (i)).

FO𝒦cFO\mathcal{K}_{c} sets are generated for cc\inFOFO\mathcal{M}, cc\notinFOFO\mathcal{M} and, for some cases, for cc close to FOFO\mathcal{M} neighborhood. To verify the connectedness property, some empirical zoomed details are considered, where DEM [5] is used.

In Figs. 2 (a)-(d) four representative cases of FOFO\mathcal{M} sets for q=0+q=0_{+}, q=0.25q=0.25, q=0.5q=0.5 and q=1q=1, respectively, are comparatively presented.

  • 1.

    Consider the FOFO\mathcal{M} for q=1q=1 (Figs. 3). As can be seen, there are several differences compared to the IO case. Thus, contrary to expectations, according to which FOFO\mathcal{M} should be similar with IOIO\mathcal{M} while qq approaches 11 (FO cases are considered, generally, that they are generalizations of IO cases), the FOFO\mathcal{M} set for q=1q=1 is far from being similar to the IOIO\mathcal{M} set. Also, the connectedness property of the IOIO\mathcal{M} seems to be broken. For example, the zoom of the detail D in Fig. 3 (a), obtained with DEM method (Fig. 3 (b)), shows that the FOFO\mathcal{M} seems to not have the connectedness property. On the other hand, again contrary to expectations, for q=1q=1, FO𝒦cFO\mathcal{K}_{c} sets look similar to IO Julia sets, but translated with 0.25-0.25 along the real axis. See for example, the FOK0FOK_{0} and IOK0.25IOK_{0.25} (Fig 3 (j) and Fig. 1 (j)), or FOK0.25FOK_{-0.25} and IOK0IOK_{0} (Fig. 3 (i) and Fig. 1 (i)). Also, the central symmetry encountered at IO𝒦cIO\mathcal{K}_{c} sets is verified, but not with respect the origin, but with respect to a horizontally translated center. Like for the IOIO\mathcal{M} set, points cc within FOFO\mathcal{M} generate connected FO𝒦cFO\mathcal{K}_{c} (Figs. 3 (d), (f), (h-j)), while points outside FOFO\mathcal{M} generate disconnected fractals (Fig. 3 (c)). Due to the inherent numerical errors, connectedness property cannot be precisely numerically stated for points close to FOFO\mathcal{M} frontier (see e.g. Fig. 3 (e) or (g)).

  • 2.

    Let the other extreme case, q=0+q=0_{+} (Figs. 4). Again, contrary to expectations, in this case, when qq approaches 0, the FOFO\mathcal{M} is similar to IOIO\mathcal{M} (Conjecture 1). Empirically verified connectedness property seems to verify (see detail D and his zoom in Fig. 4 (a) and (b)). The FO𝒦cFO\mathcal{K}_{c} sets look like some parts of a \mathcal{M} set (probably parts of the FOFO\mathcal{M}) obtained with a magnifier-like. Another property is the fact that, for all values of cc, within or outside the FOFO\mathcal{M} set, the FO𝒦cFO\mathcal{K}_{c} sets still look connected sets. Also, except the points cc on the real axis, the FO𝒦cFO\mathcal{K}_{c} sets have not central symmetry. However, probably the most important property is the fact that for c=0c=0, the FO𝒦cFO\mathcal{K}_{c} set is actually the IOIO\mathcal{M} set (see the red rectangle in Fig. 4 (i) and Conjecture 2).

  • 3.

    For the intermediate case q=0.5q=0.5, see Figs. 5. Now, excepting the values of cc belonging to the real axis, where the FO𝒦cFO\mathcal{K}_{c} sets are symmetric with respect the real axis (see Figs. 5 (h), (g), (e), (d) and Proposition 2), the central symmetry and also connectedness of the FO𝒦cFO\mathcal{K}_{c} are lost (see the zoom of detail D in Fig. 5 (a), presented in Fig. 5 (b)). Also, the frontier of the FO𝒦cFO\mathcal{K}_{c} is not connected (see the zoomed detail of the region D1D_{1}, Figs. 5 (e) and (f)).

Conclusion and open problems

In this paper the FO Mandelbrot map and set and FO Julia sets in the Caputo’s sense are introduced. Some properties of the FOFO\mathcal{M} map and FO𝒦cFO\mathcal{K}_{c} are analytically studied and some of them numerically verified. The FOFO\mathcal{M} set and FO𝒦cFO\mathcal{K}_{c} sets are obtained with the escape-time algorithm adapted for FO discrete complex maps, while to verify computationally the connectedness properties for some cases, zoomed details are obtained with DEM adapted to FO discrete complex maps. Similarities, and especially differences, between the IO case and FO case are summarizing next.

  • Probably the most interesting property is the one according to which, for q0q\downarrow 0, the FO𝒦cFO\mathcal{K}_{c} set corresponding to c=0c=0, looks similar to the Mandelbrot of IO set (Fig. 4, Conjecture 2);

  • For all qq values, The FOFO\mathcal{M} set and the FO𝒦cFO\mathcal{K}_{c} sets have symmetry with respect the real axis (Proposition 1 and Proposition 2, respectively);

  • Excepting the case q=1q=1, the FO𝒦cFO\mathcal{K}_{c} sets have not central symmetry;

  • For q=0+q=0_{+}, the underlying FO𝒦cFO\mathcal{K}_{c} corresponding to c=0c=0, is not the filled circled, like in the IO case, but the IOIO\mathcal{M} set (see Fig. 1 (i) and Fig. 4 (i));

  • For q>0q>0, the FOFO\mathcal{M} set loose connectedness property (see Paragraphs 1 and Paragraph 3, Section 5), while for q=0+q=0_{+}, this property seems verify (see detail D in Figs. 4 (a) and (b));

  • For q=0+q=0_{+} and also for some q>0q>0, the FO𝒦cFO\mathcal{K}_{c} sets are imbedded within rectangular domains \mathcal{L} which, contrary to the IO𝒦cIO\mathcal{K}_{c} sets, are not centered at the origin, but translated along the real axis (see Paragraphs 1 and 3, Section 5);

  • The FOFO\mathcal{M}, with q=1q=1, is translated horizontally with 0.25-0.25 (see Figs. 1 and Figs. 3);

  • For q=1q=1, FO𝒦cFO\mathcal{K}_{c} sets presents a central symmetry with respect a translated center (see Fig. 3);

  • Contrary to the IO case, except the case q=1q=1, for q(0,1)q\in(0,1), the FO𝒦cFO\mathcal{K}_{c} sets have not central symmetry (see Paragraphs 2 and Paragraph 3, Section 5);

  • The FO discretization for the Mandelbrot set, for q=1q=1, is not as expected, a generalization of the IOIO\mathcal{M} set (Fig. 3).

Beside the results obtained in this paper with the aid of the analytical and numerical approach, several other open problems remain, such as:

  • the proof of the translation of the FO𝒦cFO\mathcal{K}_{c} sets like in the case q=1q=1 (Figs. 3);

  • the fact that for q1q\rightarrow 1 the shape of the FOFO\mathcal{M} set (Fig. 3 (a)) does not lead, as expected, to the shape of the IOIO\mathcal{M} set, is typical only to this complex FO system, or apply to other discrete FO systems (real or complex) too? Similar question is open for the case q0q\rightarrow 0;

  • boundedness of the relations (10), i.e. boundedness of the FOFO\mathcal{M} set, for the case cc\in\mathbb{C} (Proposition 5 treats only the case cc\in\mathbb{R});

  • the proof that in the case of q=1q=1, the known filled disk for IOIO\mathcal{M} corresponding to the IO𝒦cIO\mathcal{K}_{c} for c=0c=0, looks identical with the filled circled (FO𝒦cFO\mathcal{K}_{c} set) for c=0.25c=-0.25 (Fig. 3 (i));

  • the proof of the identity between the FOFO\mathcal{M} set for q=0+q=0_{+} and the IOIO\mathcal{M} set (Fig. 4 (a) and Fig. 1 (a), Conjecture 1);

  • the proof of the identity between the FO𝒦cFO\mathcal{K}_{c} set for q=0+q=0_{+}, c=0c=0 and the IOIO\mathcal{M} set (Fig. 4 (i), Conjecture 2);

  • is the translated center of the symmetry of FO𝒦cFO\mathcal{K}_{c} sets related with the critical point of the FO𝒦cFO\mathcal{K}_{c} sets which, for the IO𝒦cIO\mathcal{K}_{c} sets of a quadratic polynomial need not be 0?

Acknowledgement
The authors would like to thank Reviewers for taking the necessary time and effort to review the manuscript.
Conflict of Interest: The authors declare that they have no conflict of interest

Refer to caption
Figure 1: The IOIO\mathcal{M} set with few filled Julia sets, IO𝒦cIO\mathcal{K}_{c}. In Fig. 1 (c), the Julia set IOJcIOJ_{c} is presented, while in Fig. 1 (b) is presented the zoomed detail D, obtained with the DEM.
Refer to caption
Figure 2: Mandelbrot sets: (a) IOIO\mathcal{M} set; (b) FOFO\mathcal{M} set for q=0.25q=0.25; (c) FOFO\mathcal{M} set for q=0.5q=0.5; (d) FOFO\mathcal{M} set for q=1q=1.
Refer to caption
Figure 3: FOFO\mathcal{M} set for q=1q=1 and some representative FO𝒦cFO\mathcal{K}_{c} sets for different values of cc; Fig. 3 (b) represents the zoomed detail DD obtained with DEM indicating disconnectedness of the FOFO\mathcal{M} set for q=1q=1.
Refer to caption
Figure 4: FOFO\mathcal{M} set for q=0+q=0_{+} and some representative FO𝒦cFO\mathcal{K}_{c} sets for different values of cc; Fig. 4 (b) represents the zoomed detail DD obtained with DEM indicating connectivity property of the FOFO\mathcal{M} for q=0+q=0_{+}. For c=0c=0 (Fig. 4 (i)), the shape of the FO𝒦cFO\mathcal{K}_{c} looks similar to the shape of the IOIO\mathcal{M} set (Fig. 1 (a)).
Refer to caption
Figure 5: FOFO\mathcal{M} set for q=0.5q=0.5 and some representative FO𝒦cFO\mathcal{K}_{c} sets for different values of cc; Fig. 5 (b) represents the zoomed detail DD obtained with DEM indicating disconnectedness of the FOFO\mathcal{M} set for q=0.5q=0.5; Fig. 5 (f) represents a zoomed detail D1D_{1} of the FO𝒦cFO\mathcal{K}_{c} set for c=0.5c=-0.5, indicating the disconnectedness.

Appendices

A Escape-time algoritm for FOFO\mathcal{M} set and FO𝒦cFO\mathcal{K}_{c} sets

There are several algorithms to plot the sets as the escape-time method, the boundary scanning method, the inverse iteration method. Also there are several optimizations to increase the speed and images accuracy (see e.g. [5]). For the exposition clarity, in this paper only black/white coloring scheme is used (for color schemes see e.g. [5]).

In this paper the Mandelbrot and Julia sets, of IO or FO, are obtained with the slow, but easy to understand escape-time algorithm based on the theorem which states that iterating fcf_{c}, with starting value z0z_{0}, only one of the following possibilities happens: either the obtained orbit remains bounded by 2, or diverges to \infty. For Mandelbrot set z0=0z_{0}=0, and cc is varied within a complex parametric domain, usually rectangular, while for Julia sets z0z_{0} is varied and cc fixed. This well known algorithm is considered in order to facilitate the presentation of the algorithm for the FOFO\mathcal{M} and FO𝒦cFO\mathcal{K}_{c} sets. For simplicity, in this paper the complex parametric plane of cc and the plane of the complex variable zz are considered similar.

  1. 1.

    To generate the FOFO\mathcal{M} set with the escape-time algorithm, consider in the cartesian plane the image of a rectangular domain of complex numbers cc, ={cx,cy|cx[cxmin,cxmax],cy[cymin,cymax],cx,cy}\mathcal{L}=\{c_{x},c_{y}|c_{x}\in[c_{x_{min}},c_{x_{max}}],c_{y}\in[c_{y_{min}},c_{y_{max}}],c_{x},c_{y}\in\mathbb{R}\}, with an equidistant grid of mx×mym_{x}\times m_{y} points (cx,cy)(c_{x},c_{y}), mx,mym_{x},m_{y}\in\mathbb{N^{*}}. The exploration of numbers cc within the considered complex domain \mathcal{L}, can be realized with two nested loops, while a third, inner cycle (steps (9)-(13), Fig.A), the core of the algorithm, makes the escape-time verification. The inside cycle implements the integrals (11) and (13). As for IOIO\mathcal{M}, for the FOFO\mathcal{M} \mathcal{L} is taken ={cx,cy|cx[2.5,0.5],cy[1.5,1.5]}\mathcal{L}=\{c_{x},c_{y}|c_{x}\in[-2.5,0.5],c_{y}\in[-1.5,1.5]\}. The domain \mathcal{L} is explored with the steps stepcx=(cxmaxcxmin)/mxstep_{c_{x}}=(c_{x_{max}}-c_{x_{min}})/m_{x}, and stepcy=(cymaxcymin)/mystep_{c_{y}}=(c_{y_{max}}-c_{y_{min}})/m_{y}. To generate the FOFO\mathcal{M}, to each cc within \mathcal{L}, one applies the recurrence (11) until, either after a chosen finite number of iterations, NN (in this paper N=30N=30), |z(n)||z(n)|, n=1,2,n=1,2,..., z0=0z_{0}=0, remains less than 2 and the underlying point cc belongs to FOFO\mathcal{M} being plotted black, or |z(n)||z(n)| becomes greater or equal to 2 (escape radius), when cc\not\inFOFO\mathcal{M} and cc is not plotted. Note that because of the symmetry of the FOFO\mathcal{M}, if one intends to generate the entire FOFO\mathcal{M} set, one might save about 50%50\% of drawing time if the algorithm is run only on the superior half of the complex plane, with ymin=0y_{min}=0 and plotting (cx,±cy)(c_{x},\pm c_{y}).

    The pseudocode is presented in Fig. A.

  2. 2.

    To generate FO𝒦cFO\mathcal{K}_{c} sets, one iterates the map fcf_{c}, but with cc fixed and z0z_{0} variable inside \mathcal{L} with the recurrence (13). The initial condition, variable, is denoted z0:=x+ıyz_{0}:=x+\i y. If after NN iterations, |z(n)||z(n)|, remains less than 2, the underlying point z0z_{0} (of coordinates xx and yy) belongs to FO𝒦cFO\mathcal{K}_{c} and is plotted black. If |z(n)||z(n)| becomes greater or equal to 2, z0z_{0}\not\inFO𝒦cFO\mathcal{K}_{c} and z0z_{0} is not plotted. The input data are NN and data defining \mathcal{L} (xmin,xmax,ymin,ymax{x_{min}},{x_{max}},{y_{min}},{y_{max}} and mx,mym_{x},m_{y}), and cc. For most of FO𝒦cFO\mathcal{K}_{c} sets, ={x,y|x[2,1],y[1.5,1.5]}\mathcal{L}=\{x,y|x\in[-2,1],y\in[-1.5,1.5]\}, not ={x,y|x[1.5,1.5],y[1.5,1.5]}\mathcal{L}=\{x,y|x\in[-1.5,1.5],y\in[-1.5,1.5]\} as for IO𝒦cIO\mathcal{K}_{c} sets. The exploration of the domain \mathcal{L} is realized with stepx=(xmaxxmin)/mxstep_{x}=(x_{max}-x_{min})/m_{x}, and stepy=(ymaxymin)/mystep_{y}=(y_{max}-y_{min})/m_{y}.

    The pseudocode is presented in Fig. B. variables xxxx and yyyy are designed for the inner loop.

Several speed improvements can be done, such as calculating x(n)x(n)+y(n)y(n)x(n)\cdot x(n)+y(n)\cdot y(n) instead x2(n)+y2(n)x^{2}(n)+y^{2}(n), or calculating only once the expressions Γ(ni+q)Γ(ni+1)\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)} and 1Γ(q)\frac{1}{\Gamma(q)}, or plotting after the domain \mathcal{L} is explored and so on. Also, the algorithm can be written y using e.g. the vectorial calculus, such as the performing matrix calculus of Matlab. Regarding the implementation in Matlab, a solution for the zero index can be found in [20].

Input : NN
cxmin,cxmax,cymin,cyminc_{x_{min}},c_{x_{max}},c_{y_{min}},c_{y_{min}}
mxm_{x}, mym_{y}
1 stepcxstep_{c_{x}}\leftarrow cxmaxcxminmx\frac{c_{x_{max}}-c_{x_{min}}}{m_{x}}
2stepcystep_{c_{y}}\leftarrow cymaxcyminmy\frac{c_{y_{max}}-c_{y_{min}}}{m_{y}}
3cxcxminc_{x}\leftarrow c_{x_{min}}
4 while cxcxmaxc_{x}\leq c_{x_{max}} do
5    cycyminc_{y}\leftarrow c_{y_{min}}
6   while cycymaxc_{y}\leq c_{y_{max}} do
7       n1n\leftarrow 1
8        x(0)0,x(0)\leftarrow 0, y(0)0y(0)\leftarrow 0
9       while n<Nn<Nand x2(n)+y2(n)<4x^{2}(n)+y^{2}(n)<4 do
10            x(n)=1Γ(q)i=1nΓ(ni+q)Γ(ni+1)(x2(i1)y2(i1)+cx)x(n)=\frac{1}{\Gamma(q)}\sum_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}(x^{2}(i-1)-y^{2}(i-1)+c_{x})
11            y(n)=1Γ(q)i=1nΓ(ni+q)Γ(ni+1)(2x(i1)y(i1)+cy)y(n)=\frac{1}{\Gamma(q)}\sum_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}(2x(i-1)y(i-1)+c_{y})
12            nn+1n\leftarrow n+1
13        end while
14       if k=Nk=N then
15           plot(cx,cy,black)(c_{x},c_{y},black)
16        end if
17       cycy+stepcyc_{y}\leftarrow c_{y}+step_{c_{y}}
18    end while
19   cxcx+stepcxc_{x}\leftarrow c_{x}+step_{c_{x}}
20 end while
Algorithm 1 Algorithm for FOFO\mathcal{M} set
Figure A: Pseudocode of escape-time algorithm for FOFO\mathcal{M} set.
Input : NN
cx,cyc_{x},c_{y}
xmin,xmax,ymin,yminx_{min},x_{max},y_{min},y_{min}
mxm_{x}, mym_{y}
1 stepxstep_{x}\leftarrow xmaxxminmx\frac{x_{max}-x_{min}}{m_{x}}
2stepystep_{y}\leftarrow ymaxyminmy\frac{y_{max}-y_{min}}{m_{y}}
3xxminx\leftarrow x_{min}
4 while xxmaxx\leq x_{max} do
5    yyminy\leftarrow y_{min}
6   while yymaxy\leq y_{max} do
7        n1n\leftarrow 1
8        xx(0)xxx(0)\leftarrow x, yy(0)yyy(0)\leftarrow y
9       while n<Nn<N and xx2(n)+yy2(n)<4xx^{2}(n)+yy^{2}(n)<4 do
10            xx(n)=xx(0)+1Γ(q)i=1nΓ(ni+q)Γ(ni+1)(xx2(i1)yy2(i1)+cx)xx(n)=xx(0)+\frac{1}{\Gamma(q)}\sum_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}(xx^{2}(i-1)-yy^{2}(i-1)+c_{x})
11            yy(n)=yy(0)+1Γ(q)i=1nΓ(ni+q)Γ(ni+1)(2xx(i1)yy(i1)+cy)yy(n)=yy(0)+\frac{1}{\Gamma(q)}\sum_{i=1}^{n}\frac{\Gamma(n-i+q)}{\Gamma(n-i+1)}(2xx(i-1)yy(i-1)+c_{y})
12            nn+1n\leftarrow n+1
13        end while
14       if k=Nk=N then
15           plot(x,y,black)(x,y,black)
16        end if
17       yy+stepyy\leftarrow y+step_{y}
18    end while
19   xx+stepxx\leftarrow x+step_{x}
20 end while
Algorithm 2 Algorithm for FO𝒦cFO\mathcal{K}_{c} set
Figure B: Pseudocode of escape-time algorithm for FO𝒦cFO\mathcal{K}_{c} sets.

References

  • [1] Brooks, R. Matelski, P.: The dynamics of 2-Generator Subgroups of PSL(2,C), in Irwin Kra ed.. Riemann Surfaces and Related Topics: Proceedings of the 1978 Stony Brook Conference. 1 May (1981)
  • [2] Mandelbrot, B.: Fractal Aspects of the Iteration of zz(1z)z\mapsto z(1-z) for Complex λ,z\lambda,z. Annals of the New York Academy of Sciences. 357(1), 249–259 (1980)
  • [3] Peitgen, H.-O., Peter, H.R.: The Beauty of Fractals Images of Complex Dynamical Systems. Springer, (1986)
  • [4] Branner, B.: The Mandelbrot Set. In Chaos and Fractals: The mathematics behind the computer graphics. Proc. Sympos. Appl. Math., Vol. 39 (Ed. R. L. Devaney and L. Keen). Providence, RI: Amer. Math. Soc., 75-105, (1989)
  • [5] Barnsley M.F. Devaney, R.L. Mandelbrot, B.B., Peitgen, H.O. Saupe, D. Voss, R.F.: With Contributions by Yuval Fisher Michael McGuire. The Science of Fractal Image, Springer-Verlag New York Inc (1988)
  • [6] Mandelbrot, B.: The Fractal Geometry of Nature, W. H. Freeman, New York, (1983)
  • [7] Douady, A. Hubbard, J.H.: Etude Dynamique des Polynômes Complexes. Prépublications mathémathiques d’Orsay 2/4 (1984/1985)
  • [8] Kahn, J.: The Mandelbrot Set is Connected: A Topological Proof. August 2001 http://www.math.brown.edu/~kahn/mconn.pdf
  • [9] Douady, A. Hubbard, J.H.: Exploring the Mandelbrot Set. The Orsay Notes. DOI:10.1.1.145.3570
  • [10] Hubbard, J. H.: Local Connectivity of Julia Sets and Bifurcation Loci: Three Theorems of J.-C. Yoccoz. Topological methods in modern mathematics. Stony Brook, NY, 1991. Houston, TX: 467–511 (1993)
  • [11] Devaney, R.: The Mandelbrot Set and the Farey Tree, and the Fibonacci Sequence. Amer. Math. Monthly 106, 289–302 (1999)
  • [12] Li, C. Zeng, F.: Numerical Methods for Fractional Calculus. Chapman & Hall/CRC Numerical Analysis and Scientific Computing Series (2020)
  • [13] Diaz J.B., Olser T.J.: Differences of Fractional Order. Math Comput 28(125),185-202 (1974)
  • [14] Abdeljawad T. On Riemann and Caputo Fractional Differences. Computers & Mathematics with Applications, 62(3),1602-1611 (2011)
  • [15] Fečkan, M. Pospisil, M., Danca, M.-F., Wang, J.: Caputo Delta Weakly Fractional Difference Equations. Fract. Calc. Appl. Anal., accepted (2022)
  • [16] Fečkan, M. Pospíšil, M.: Note on Fractional Difference Gronwall Inequalities. Elec. J. Qual. Theor. Diff. Equations 44, 1-18 (2014)
  • [17] Cermak, J. Gyori, I. Nechvatal, L. On Explicit Stability Conditions for a Linear Fractional Difference System. Fract Calc Appl Anal 18,651-672 (2015)
  • [18] Chen, F.L.: A review of Existence and Stability Results for Discrete Fractional Equations. J Comput Complex Appl 1,22-53 (2015)
  • [19] Danca, M.-F. Symmetry-Breaking and Bifurcation Diagrams of Fractional-order Maps. CNSNS, 116, 106760 (2023)
  • [20] Danca, M.-F. Fractional Order Logistic Map: Numerical Approach. Chaos, Solitons & Fractals, 157, 111851 (2022)
  • [21] Danca, M.-F., Fečkan, M., Kuznetsov, N., Chen, G.: Coupled Discrete Fractional-Order Logistic Maps. Mathematics 9, 220 (2021)
  • [22] Diblík, J., Fečkan, M., Pospíšil, M.: Nonexistence of Periodic Solutions and SS-Asymptotically Periodic Solutions in Fractional Difference Equations. Applied Mathematics and Computation 257, 230-240 (2015)
  • [23] https://en.wikipedia.org/wiki/Mandelbrot_set#cite_note-bf-4
  • [24] Milnor, J.: Dynamics in One Complex Variable. Third Edition. (AM-160). Princeton University Press, (2006)
  • [25] Blanchard, P.: Disconnected Julia Sets. Chaotic Dynamics and Fractals, eds. Barnsley M, Demko S. Academic Press. 181–201 (1986)
  • [26] Branner, B. Hubbard, J.H.: Iteration of Cubic Polynomials, Part I: The Global Topology of Parameter Space. Acta Mathematica 160, 143–206 (1988)
  • [27] Branner, B., Hubbard, J.H.: Iteration of Cubic Polynomials, Part II: Patterns and Parapatterns. Acta Mathematica 169, 229 (1992)
  • [28] Danca, M.-F. Bourke, P. Romera, M.: Graphical Exploration of the Connectivity Sets of Alternated Julia Sets; M, the Set of Disconnected Alternated Julia Sets. Nonlinear Dynamics, 73(1), 1155–1163 (2013)
  • [29] Atici, F.M. Eloe, P.W.: Initial Value Problems in Discrete Fractional Calculus. Proceedings of the American Mathematical 137(3), 981–989 (2009)
  • [30] Anastassiou, G.: Principles of Delta Fractional Calculus on Time Scales and Inequalities. Mathematical and Computer Modelling 52(3-4), 556-566 (2010)
  • [31] Agarwal, R.P., Bohner, M.: Basic Calculus on Time Scales and Some of its Applications. Results Math. 35(1-2), 3-22 (1999)
  • [32] Feldman, D.P.: Chaos and Fractals: An Elementary Introduction. Oxfor University Press, (2012)