Publication Cover
Mathematical and Computer Modelling of Dynamical Systems
Methods, Tools and Applications in Engineering and Related Sciences
Volume 30, 2024 - Issue 1
0
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Analytical and approximate monotone solutions of the mixed order fractional nabla operators subject to bounded conditions

, , , , &
Pages 626-639 | Received 18 Mar 2024, Accepted 04 Jun 2024, Published online: 05 Jul 2024

ABSTRACT

In this study, the sequential operator of mixed order is analysed on the domain (μ2,μ1)(0,1)×(0,1) with 1<μ2+μ1<2. Then, the positivity of the nabla operator is obtained analytically on a finite time scale under some conditions. As a consequence, our analytical results are introduced on a set, named Em,ζ, on which the monotonicity analysis is obtained. Due to the complicatedness of the set Em,ζ several numerical simulations so are applied to estimate the structure of this set and they are provided by means of heat maps.

1. Introduction

Theoretical and applied discrete fractional calculus have been widely employed in many fields such as engineering, astronomy, physics, biology, economics, computer science, and other domains, as described in the published articles (Atici and Eloe Citation2008; Wu and Baleanu Citation2015; Gholami and Ghanbari Citation2016; Baleanu et al. Citation2017; Mozyrska et al. Citation2019). In recent years, many researchers have introduced fractional sums and difference operators with new kernels including fractional Riemann-Liouville, Liouville-Caputo, AB, CF difference operators (cf. Goodrich and Peterson Citation2015; Abdeljawad Citation2018; Mohammed and Abdeljawad Citation2023).

In many branches relying upon fractional difference operators, the positivity and monotonicity analyses with or without some initial conditions are abundantly applied. Positivity and monotonicity analyses have proven to be useful tools with a wide variety of applications in the mathematical analysis. Among them, they have been applied to determine the existence and uniqueness of fractional difference models, and to determine a function to be increasing or decreasing. Analysing fractional difference problems involves a distinct set of challenges and techniques until we get the positivity of the delta or nabla function for all of the fractional Riemann-Liouville, Liouville-Caputo, AB, and CF difference operators (Abdeljawad and Baleanu Citation2016; Goodrich and Lyons Citation2020; Liu et al. Citation2020; Mohammed et al. Citation2021b; Mohammed Citation2024).

Furthermore, some analyses (monotonicity and positivity), those are related to the sequential fractional operators or mixed order difference operators, are more complicated to analyse than the above ones. As a result, various problems of importance in discrete fractional calculus have been investigated on sequential fractional operators, including Riemann-Liouville, Liouville-Caputo difference operators (Dahal et al. Citation2021; Mohammed and Almusawa Citation2023), and CF and AB difference operators (Goodrich and Jonnalagadda Citation2021; Mohammed et al. Citation2022, Citation2022).

In this article, our objective is to study a new discrete sequential fractional operator of mixed order of the form

(1.1)  a+1RLμ2aRLμ1f(x),(1.1)

on the set W, defined by

(1.2) W:={(μ1,μ2)(0,1)×(0,1)with1<μ2+μ1<2},(1.2)

where  aRLμ1 is defined in (2.2). As a result, the monotonicity of the function f will be deduced analytically and numerically. The objective of the work is to show that the sequential fractional operator (1.1) with negative in lower boundedness can give the positivity of the function. The obtained results can be easily applied to other sequential fractional operators using the proposed domain and further different conditions.

Let us now describe the plan of this study: First, Section 2 reviews definitions of discrete operator, and the basic results for (1) defined on the set W are stated and proved as needed in the paper. Then, in Section 3, we demonstrate that, with detailed information about the initial and negative lower bounded conditions, the function will be increasing on a finite subset set of Na+2{a+2,a+3,}. The numerical simulations and heatmap illustration is discussed in Section 4. Finally, we conclude the paper by presenting a summary and discussion in Section 5.

2. Preliminaries

The nabla fractional sum and difference operators are the main definitions used in the current article; see [6, Definition 3.58] and [13, Lemma 2.1]. They are, respectively, defined by

(2.1)  aRLμ1f(x)=s=a+1x(x+1s)μ11Γ(μ1)f(s),(2.1)

for 0<μ1 and xNa+1, and

(2.2)  aRLμ1f(x)=1Γ(μ1)s=a+1x(x+1s)μ11f(s),(2.2)

for m1<μ1<m and xNa+m with mN1. Above we have used f(x)=f(x)f(x1) and

(2.3) xμ1=μ1xμ11,xμ1=Γμ1+xΓx,(2.3)

where the last identity leads to zero when Γx is undefined while Γμ1+x is well-defined.

Lemma 2.1.

Let 0<μ2, 0<μ1<1 and f be defined on Na. Then we have

(2.4)  a+1RLμ2aRLμ1f(x)= aRLμ1μ2f(x)(xa)μ21Γ(μ2)f(a+1),(2.4)

for xNa+1.

Proof.

Denoting g(x) by  aRLμ1f(x). Then by considering (2.1), we have

 a+1RLμ2aRLμ1f(x)= a+1RLμ2g(x)=1Γ(μ2)s=a+2x(xs+1)μ21g(s)=1Γ(μ2)s=a+1x(xs+1)μ21g(s)(xa)μ21Γ(μ2)g(a+1)= aRLμ2aRLμ1f(x)(xa)μ21Γ(μ2)f(a+1)= aRLμ1μ2f(x)(xa)μ21Γ(μ2)f(a+1),

where we have used,

ga+1= aRLμ1fa+1=1Γμ1s=a+1a+1a+2sμ11fs=fa+1,

which gives the required result. Hence, our proof is completed.

Theorem 2.1.

Let f be defined on Na. Then, for μ1 and μ2 in the interval (0,1), we obtain

(2.5)  a+1RLμ2aRLμ1f(x)= aRLμ1+μ2f(x)(xa)μ21Γ(μ2)f(a+1),(2.5)

for xNa+2.

Proof.

Considering Lemma 2.1, we have for 0<μ1,μ2<1:

 a+1RLμ2aRLμ1f(x)=2 a+1RL(μ2+2)aRLμ1f(x)=2 a+1RLμ1+μ22f(x)(xa)μ21Γ(μ2)f(a+1).

Next, by applying [6, Lemma 3.108] on the last equality, we get

 a+1RLμ2aRLμ1f(x)=2 a+1RLμ1+μ22f(x)2(xa)μ21Γ(μ2)f(a+1)= a+1RLμ1+μ2f(x)f(a+1)2(xa)μ21Γ(μ2).

Consequently, by applying [6, Theorem 3.57] on this equality, we obtain

 a+1RLμ2aRLμ1f(x)= aRLμ1+μ2f(x)(xa)μ21Γ(μ2)f(a+1),

and this proves (2.5). Thus, we have completed the proof.

3. Nabla positivity results

Here, we get our positivity results for the nabla difference operator. This section starts with finding (∇f)(a+n) on the set W.

Lemma 3.1.

Let f be defined on Na, (μ1,μ2)W and a+1RLμ21ptaRLμ1f(x).3ex=x, for xNa+3. Then we have

(3.1) (∇f)(a+n)= x>$Γ(μ2+n1)(n1)!Γ(μ2)Γ(μ2μ1+n)Γ(μ2μ1+1)(n1)!ζf(a+1)i=0n3Γ(μ2μ1+ni1)Γ(ni1)Γ(μ2μ1+1)(f)(a+i+2),(3.1)

for nN3 and ζ.3ex=x0. Furthermore,

(3.2) Γ(μ2+n1)(n1)!Γ(μ2)>Γ(μ2μ1+n)Γ(μ2μ1+1)(n1)!,(3.2)

and

(3.3) Γ(μ2μ1+ni1)Γ(ni1)Γ(μ2μ1+1)>0,(3.3)

for i=0,1,,n4 and nN4.

Proof.

Based on the identity (2.5) and Definition (2.2), one can have

(3.4)  a+1RLμ2aRLμ1f(x)= aRLμ1+μ2f(x)(xa)μ21Γ(μ2)f(a+1)=1Γ(μ1μ2)s=a+1x(xs+1)μ1μ21f(s)(xa)μ21Γ(μ2)f(a+1)=(2.3)by1Γ(μ1μ2+1)s=a+1x(xs+1)μ1μ2f(s)(xa)μ21Γ(μ2)f(a+1)=1Γ(μ1μ2+1)[(xa)μ1μ2f(a+1)+Γ(μ1μ2+1)(f)(x)+s=a+2x1(xs+1)μ1μ2(f)(s)](xa)μ21Γ(μ2)f(a+1)=(∇f)(x)+[(xa)μ1μ2Γ(μ1μ2+1)(xa)μ21Γ(μ2)]f(a+1)+1Γ(μ1μ2+1)s=a+2x1(xs+1)μ1μ2(f)(s),(3.4)

where we have used that (0)μ1μ2=0. By using the assumption that a+1RLμ21ptaRLμ1f(x).3ex=xζ1ptf(a+1), it follows that:

(f)(x)= x>$(xa)μ21Γ(μ2)(xa)μ1μ2Γ(μ1μ2+1)ζf(a+1)1Γ(μ1μ2+1)s=a+2x1(xs+1)μ1μ2(f)(s).

Letting n:=xa. Then it follows that

∇fa+nnμ21Γμ2nμ2μ1Γμ2μ1+1ζfa+11Γμ2μ1+1i=0n3ni1μ2μ1∇fa+i+2,

which rearranges to (3.1) for nN3.

Now, let us prove the inequalities (3.2) and (3.3):

Γ(μ2+n1)(n1)!Γ(μ2)=(μ2)<0(μ2+1)<0(n3μ2)(nμ2+2)(n1)!>0,

and

Γ(μ2μ1+n)Γ(μ2μ1+1)(n1)!=(μ2μ1+1)<0(μ2μ1+2)(nμ2μ1+2)(μ2+n1μ1)(n1)!<0,

these give the required inequality (3.2) for nN3, 1<μ2<2 and 1<μ2+μ1<2. Furthermore, the inequality (3.3) can be obtained as follows:

Γ(μ2μ1+ni1)Γ(ni1)Γ(μ2μ1+1)(μ2μ1+ni2)(μ2μ1+ni3)(μ2μ1+2)(μ2μ1+1)<0(ni2)!>0,

when i=0,1,,n4 with nN4 and 1<μ2+μ1<2. This finishes the proof.

Theorem 3.1.

Let f be defined on Na, (μ1,μ2)W. Then having the following conditions

(a)f(a+1)= x>$0,(b)(f)(a+2)= x>$0,(c) a+1RLμ2aRLμ1f(a+3)= x>$ζf(a+1),(d)μ2= x>$2μ12ζμ11,

give that (∇f)(a+3).3ex=x0.

Proof.

If we reuse (3.1) for n=3, we see that

(3.5) (∇f)(a+3)= x>$Γ(μ2+2)2!Γ(μ2)Γ(μ2μ1+3)Γ(μ2μ1+1)(n1)!ζf(a+1)= x>$0by(a)(μ2μ1+1)>0(f)(a+2)= x>$0by(b),(3.5)

which is .3ex=x0 such that

Γ(μ2+2)2!Γ(μ2)Γ(μ2μ1+3)Γ(μ2μ1+1)(n1)!ζ= x>$0.

This is equivalent to,

μ2(μ2+1)2(μ2μ1+1)(μ2μ1+2)2ζ= x>$0.

Simplifying this inequality carefully give us

μ2= x>$2μ12ζμ11,

and which is true according to the condition (d). Hence (∇f)(a+3).3ex=x0 due to (3.5), as requested.

In the next lemma, we will prove that the collection {En,ζ}n=3 is a decreasing collection of the sets En,ζW, defined by

(3.6) En,ζ(μ1,μ2)W:Γ(μ2+n1)Γ(μ2)(n1)!Γ(μ2μ1+n)Γ(μ2μ1+1)(n1)!= x>$ζ,(3.6)

for each nN3 and ζ.3ex=x0.

Lemma 3.2.

For any ζ.3ex=x0 and nN3, we have

En+1,ζEn,ζ,

furthermore, we have,

n=3En,ζ=limnEn,ζ=,

Proof.

Let ζ.3ex=x0. Then we will try to prove that

En+1,ζEn,ζ,

for any nN3 and (μ1,μ2)W that is, if

Γ(μ2+n)Γ(μ2)(n)!Γ(μ2μ1+n+1)Γ(μ2μ1+1)(n)!= x>$ζ,

then we must have,

Γ(μ2+n1)(n1)!Γ(μ2)Γ(μ2μ1+n)Γ(μ2μ1+1)(n1)!= x>$ζ.

It is enough to show that,

(3.7) Γ(μ2+n1)Γ(μ2)(n1)!Γ(μ2μ1+n)Γ(μ2μ1+1)(n1)!= x>$Γ(μ2+n)Γ(μ2)(n)!Γ(μ2μ1+n+1)Γ(μ2μ1+1)(n)!,(3.7)

because (3.7) and our hypothesis ((μ1,μ2)En+1) immediately give that

Γ(μ2+n1)Γ(μ2)(n1)!Γ(μ2μ1+n)Γ(μ2μ1+1)(n1)!= x>$Γ(μ2+n)Γ(μ2)(n)!Γ(μ2μ1+n+1)Γ(μ2μ1+1)(n)!= x>$ζ,

and this implies that (μ1,μ2)En. Now, we can rewrite inequality (3.7) as follows

(3.8) Γ(μ2+n1)(n1)!Γ(μ2)Γ(μ2+n)Γ(μ2)(n)!= x>$Γ(μ2μ1+n)Γ(μ2μ1+1)(n1)!Γ(μ2μ1+n+1)Γ(μ2μ1+1)(n)!,(3.8)

or equivalently,

Γ(μ2+n1)(n1)!Γ(μ2)μ2+n1Γ(μ2+n1)Γ(μ2)n(n1)!= x>$Γ(μ2μ1+n)Γ(μ2μ1+1)(n1)!μ2μ1+nΓ(μ2μ1+n)Γ(μ2μ1+1)n(n1)!,

or equivalently,

(μ21)Γ(μ2+n1)Γ(μ2)(n1)!= x>$(μ2μ1)Γ(μ2μ1+n)Γ(μ2μ1+1)(n1)!.

Simplifying this to have

(3.9) Γ(μ2μ1+n)Γ(μ2μ1)(n1)!Γ(μ2+n1)Γ(μ21)(n1)!= x>$0.(3.9)

But the inequality is (3.9) true and one can show it by the same technique used in (3.2). This gives the result of the first part.

To end the proof of the second part of the lemma, we define the sequences {An}n=1 and {Bn}n=1, where

An=Γ(μ2+n1)(n1)!Γ(μ2),

and

Bn=Γ(μ2μ1+n)Γ(μ2μ1+1)(n1)!.

Then taking the limits, we see that

limnAn=limnΓ(μ2+n1)Γ(μ2)(n1)!=limnΓ(μ2+n1)Γ(μ2)(n1)!(n1)μ21(n1)μ21=limnΓ(μ2+n1)Γ(n1)(n1)μ2=1by using [19, Theorem 3.41]limn(n1)μ21Γ(μ2)=0=0,

and

limnBn=limnΓ(μ2μ1+n)Γ(μ2μ1+1)(n1)!=limnΓ(μ2μ1+n)Γ(n1)(n1)μ2+μ1=1limn(n1)μ2μ11Γ(μ2μ1+1)=0=0.

Consequently, we have

limnΓ(μ2+n1)(n1)!Γ(μ2)Γ(μ2μ1+n)Γ(μ2μ1+1)(n1)!=limnAnBn=0.

As a result, since ζ.3ex=x0, we see that

n0:=sup{nN;AnBn= x>$ζ}<+,

and this suggests that En,ζ=, for each n.3ex=xn0. Therefore, n=3En,ζ=, as required.

Lemmas 3.1−3.2 and Theorem 3.1 help us to state and prove the following major corollary which generalizes the positivity result in Theorem 3.1.

Corollary 3.1.

Assume that (μ1,μ2)W and f is defined on Na having the following conditions on it

(a)f(a+1)= x>$0,(b)(f)(a+2)= x>$0,(c) a+1RLμ2aRLμ1f(x)= x>$ζf(a+1),xNa+3a+m01,(d)μ2= x>$2μ12ζμ11,

for some m0Na+3. Let (μ1,μ2)Em0,ζ. Then (∇f)(x).3ex=x0 for each xNa+2a+m01.

Proof.

Let m0 be a fixed point in Na+3. Then based on Lemma 3.1 one can have

(3.10) (∇f)(a+2+m0)= x>$Γ(μ2+m1)Γ(μ2)(m1)!Γ(μ2μ1+m)Γ(μ2μ1+1)(m1)!ζf(a+1)= x>$0(3.10)

iff

(3.11) (μ1,μ2)i=3m0Ei,ζ,(3.11)

for each m[3,m0]. Now, since (μ1,μ2)W, we see from Lemma 3.2 that

i=3m0Ei,ζ=Em0,ζ.

Therefore, μ1,μ2i=3m0Ei,ζ because (μ1,μ2)Em,ζ. Thus (3.11) is satisfied, and hence (3.10) is satisfied. As consequences of (3.10) and Theorem 3.1, we obtain the desired result

(∇f)(x)= x>$0,

for each xNa+2a+m01.

4. The application

We dedicate this section to give an example to demonstrate the applicability of Theorem 3.1. As we noted in Section 3, it is very complicated to analyse the set Em,ζ analytically even if m is small enough and ζ>0. For this reason, we dedicate another part of this section to discuss the structure of the set Em,ζ via numerical simulations (heat maps). For instance, we have performed all implementations using Matlab.

The following example confirm the applicability of Corollary 3.1 (or specifically Theorem 3.1).

Example 4.1

Consider the function f:N1R having the following values

Further, we set μ1=0.5,μ2=0.97 and ζ=0.1. From , we see that

Table 1. Data values.

f(1)= x>$0,(∇f)(2)= x>$0.

In addition,

0.97=μ2= x>$2μ12ζμ11=20.520.10.51=0.95,

and

 1RL0.970RL0.5f3=1Γ1.45s=134s2.45fsx1.97Γ0.97f1=0.09360.099=0.10.99=ζf1.

Thus, conditions (a)–(d) of Theorem 3.1 is satisfied. Although it is clear that (∇f)(3).3ex=x0, Theorem 3.1 confirms it.

Example 4.2.

Reconsidering the above example in another view, we have.

E3,0.1(μ1,μ2)W:(μ2)(μ2+1)2(μ2μ1+1)(μ2μ1+2)2= x>$0.1,

as it is shown in .

Figure 1. The region of the set E3,0.01 in W.

Figure 1. The region of the set E3,0.01 in W.

Next, we indicate the cardinality of the set

Fζ{m;(μ1,μ2)Em,ζ},

for ζ{0.1,0.001,0.00001,0.0000001} in and for ζ{1100,1400,1700,11000} in via heat map representations. Note that the sidebar of subplots are the actual cardinalities. We can note from the figures that the cardinality of Fζ changes from dark blue to dark red i.e. it increases from small to large.

Figure 2. Heat maps for Fζ for ζ{0.1,0.001,0.00001,0.0000001}.

Figure 2. Heat maps for Fζ for ζ∈{0.1,0.001,0.00001,0.0000001}.

Figure 3. Heat maps for Fζ for ζ{1100,1400,1700,11000}.

Figure 3. Heat maps for Fζ for ζ∈{1100,1400,1700,11000}.

In particular, the change in the acuity of the boundaries of the heat map regions enables us to conclude the following results:

limζ0+|Fζ|=+. Particularly, it means that if we have f:NaR with

 a+1RLμ2aRLμ1f(x)= x>$ζf(a+1),

then the number of points at which (∇f)(x)>0 tends to + when ζ0+.

  • If the negative lower bound on  a+1RLμ2aRLμ1f(x) is not negative, then f maybe increase for a long-time as in Corollary 3.1.

  • It appears that,

|Em,ζ{(μ1,μ2)W;μ2= x>$2μ12}|0,
for a sufficiently small value of ζ and not too large value of m. In other words, if ζ0+, then for plenty of time steps the admissible parameter space converges to the configuration of parameter space as ζ=0 i.e.
Em,ζ{(μ1,μ2)W;μ2= x>$2μ12},

for m is not too large.

5. Concluding remarks

This study has dealt with analysing the sequential operator of order (μ2,μ1)(0,1)×(0,1), where 0<μ2+μ1<1 analytically. As a consequence, we have found the main formula for (∇f)(a+m) in Lemma 3.1 as an inequality. This helped us to find that (∇f)(a+3).3ex=x0 with four conditions as a preliminary main result. However, it was not the only aim of the article and we have continued by considering the set Em,ζ, which we have structured it from the inequality (3.1). We have found that this set is decreasing. Due to the decrease of this set we have then investigated that (∇f)(a+m).3ex=x0 on a finite time scale mN2τ, where τN2. On the other hand, even for small values m and 0<ζ we couldn’t analyse the set Em,ζ accurately. Therefore, we have jumped for numerical simulations to estimate the set Em,ζ numerically as we have demonstrated it graphically in the last section of the article based on the heat maps. We have concluded that the cardinality of Fζ increases from small to large as shown in for different values of ζ.

Extensions of our theory of the nabla sequential operators to more general fractional difference operators are underway, and constitute the focus of a promising research line, in which the researchers can use the following generalized articles (see Mohammed et al. Citation2021a; Mohammed and Abdeljawad Citation2023).

Acknowledgments

Researchers Supporting Project number (RSP2024R153), King Saud University, Riyadh, Saudi Arabia.

Disclosure statement

No potential conflict of interest was reported by the author(s).

References

  • Abdeljawad T. 2018. Different type kernel h–fractional differences and their fractional h–sums. Chaos Solit Fract. 116:146–156. doi: 10.1016/j.chaos.2018.09.022.
  • Abdeljawad T, Baleanu D. 2016. Discrete fractional differences with nonsingular discrete Mittag-Leffler kernels. Adv Differ Equ. 2016(1):1–5. doi: 10.1186/s13662-016-0949-5.
  • Atici FM, Eloe PW. 2008. Initial value problems in discrete fractional calculus. Proc Amer Math Soc. 137(3):981–989. doi: 10.1090/S0002-9939-08-09626-3.
  • Baleanu D, Wu GC, Bai YR, Chen FL. 2017. Stability analysis of Caputo-like discrete fractional systems. Commun Nonlinear Sci Numer Simul. 48:520–530. doi: 10.1016/j.cnsns.2017.01.002.
  • Dahal R, Goodrich CS, Lyons B. 2021. Monotonicity results for sequential fractional differences of mixed orders with negative lower bound. J Differ Equ Appl. 27(11):1574–1593. doi: 10.1080/10236198.2021.1999434.
  • Gholami Y, Ghanbari K. 2016. Coupled systems of fractional ∇-difference boundary value problems. Differ Eq Appl. 8(4):459–470. doi: 10.7153/dea-08-26.
  • Goodrich CS, Jonnalagadda JM. 2021. Monotonicity results for CFC nabla fractional differences with negative lower bound. Anal (Berlin). 41(4):221–229. doi: 10.1515/anly-2021-0011.
  • Goodrich CS, Lyons B. 2020. Positivity and monotonicity results for triple sequential fractional differences via convolution. Analysis. 40(2):89–103. doi: 10.1515/anly-2019-0050.
  • Goodrich CS, Peterson AC. 2015. Discrete fractional calculus. (NY): Springer.
  • Liu X, Du F, Anderson D, Jia B. 2020. Monotonicity results for nabla fractional h-difference operators. Math Meth Appl Sci. 1–21. doi: 10.1002/mma.6823.
  • Mohammed PO. 2024. Some positive results for exponential-kernel difference operators of Riemann-Liouville type. Math Model Control. 4(1):133–140. doi: 10.3934/mmc.2024012.
  • Mohammed PO, Abdeljawad T. 2023. Discrete generalized fractional operators defined using h-discrete Mittag-Leffler kernels and applications to AB fractional difference systems. Math Meth Appl Sci. 46(7):7688–7713. doi: 10.1002/mma.7083.
  • Mohammed PO, Abdeljawad T, Hamasalh FK. 2021a. Discrete Prabhakar fractional difference and sum operators. Chaos Solit Fractals. 150:111182. doi: 10.1016/j.chaos.2021.111182.
  • Mohammed PO, Abdeljawad T, Hamasalh FK. 2021b. On Riemann—Liouville and Caputo fractional forward difference monotonicity analysis. Mathemat. 9(11):1303. doi: 10.3390/math9111303.
  • Mohammed PO, Almusawa MY. 2023. On analysing discrete sequential operators of fractional order and their monotonicity results. AIMS Math. 8(6):12872–12888. doi: 10.3934/math.2023649.
  • Mohammed PO, Almutairi O, Agarwal RP, Hamed YS. 2022. On convexity, monotonicity and positivity analysis for discrete fractional operators defined using exponential kernels. Fractal Fract. 6(2):55. doi: 10.3390/fractalfract6020055.
  • Mohammed PO, Goodrich CS, Hamasalh FK, Kashuri A, Hamed YS. 2022. On positivity and monotonicity analysis for discrete fractional operators with discrete Mittag–Leffler kernel. Math Methods In App Sci. 45(10):6391–6410. doi: 10.1002/mma.8176.
  • Mozyrska D, Torres DFM, Wyrwas M. 2019. Solutions of systems with the Caputo–Fabrizio fractional delta derivative on time scales. Nonlinear Anal Hybrid Syst. 32:168–176. doi: 10.1016/j.nahs.2018.12.001.
  • Wu G, Baleanu D. 2015. Discrete chaos in fractional delayed logistic maps. Nonlinear Dyn. 80(4):1697–1703. doi: 10.1007/s11071-014-1250-3.