Next Article in Journal
Traffic-Sign-Detection Algorithm Based on SK-EVC-YOLO
Previous Article in Journal
Novel Multistep Implicit Iterative Methods for Solving Common Solution Problems with Asymptotically Demicontractive Operators and Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A New Approach to Discrete Integration and Its Implications for Delta Integrable Functions

1
Department of Mathematics, Faculty of Science and Arts, King Khalid University, Muhayl Assir 61913, Saudi Arabia
2
Department of Mathematics, Sacred Heart College, Tirupattur 635601, India
3
Department of Mathematics, St. Joseph’s College of Engineering, OMR, Chennai 600119, India
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(18), 3872; https://doi.org/10.3390/math11183872
Submission received: 17 July 2023 / Revised: 6 September 2023 / Accepted: 7 September 2023 / Published: 11 September 2023
(This article belongs to the Section Difference and Differential Equations)

Abstract

:
This research aims to develop discrete fundamental theorems using a new strategy, known as delta integration method, on a class of delta integrable functions. The ν th-fractional sum of a function f has two forms; closed form and summation form. Most authors in the previous literature focused on the summation form rather than developing the closed-form solutions, which is to say that they were more concerned with the summation form. However, finding a solution in a closed form requires less time than in a summation form. This inspires us to develop a new approach, which helps us to find the closed form related to nth-sum for a class of delta integrable functions, that is, functions with both discrete integration and nth-sum. By equating these two forms of delta integrable functions, we arrive at several identities (known as discrete fundamental theorems). Also, by introducing -order delta integrable functions, the discrete integration related to the ν th-fractional sum of f can be obtained by applying Newton’s formula. In addition, this concept is extended to h-delta integration and its sum. Our findings are validated via numerical examples. This method will be used to accelerate computer-processing speeds in comparison to summation forms. Finally, our findings are analyzed with outcomes provided of diagrams for geometric, polynomial and falling factorial functions.

1. Introduction

In recent decades, discrete version of fractional calculus has sparked significant attention across various fields like physics, chemistry, biology and engineering [1,2,3,4,5]. By the late nineteenth century, Riemann, Liouville, Grunwald, Letnikov and some others pooled their efforts to produce a very solid knowledge base of fractional calculus in the continuous case. Fractional calculus has applications in capacitor theory, electroanalytical chemistry, viscoelasticity, electrical theory, diffusion, neurology, control theory and statistics according to Podlubny [6,7]. The authors in [8] developed a generalization of the binomial formula for the N th—order difference N f . In [9], the authors established a specific example for one composition rule as well as variants of a power rule and the Leibniz formula. In [2], the authors introduced fractional differential equations and fractional calculus, whereas [10,11,12] examined the delta operators and their properties in fractional sums. Applications of discrete and continuous fractional calculus are provided in books [13,14,15], and for more details one can also refer to articles [16,17,18,19,20,21] and references therein.

Methodology and Contribution of the Work

The objective of this research is to construct a thorough and exact theory for integer- and fractional-order delta integration, as well as its fundamental theorem. By setting h = 1 , one can refer to the difference and anti-difference notions from [22,23,24,25].
The importance of this work arises from the author’s previous partial development of various fractional-order sums. For example, in the field of discrete fractional calculus [13], the ν th-fractional sum of f from a to t for ν > 0 is defined by
a Δ ν f ( t ) = 1 Γ ( ν ) s = a t ν Γ ( t s ) Γ ( t s ( ν 1 ) ) f ( s ) .
Here, s N a for f and is defined for t N a + ν for Δ ν f . It is feasible to find the value of a Δ ν f ( t ) using Equation (1). The right side of Equation (1) is referred to as the summation form of a Δ ν f ( t ) . At the same time, a Δ ν will have another form (closed form) other than the summation form given in right side of Equation (1) for a certain class of functions f, such functions are named as delta integrable functions: That is a function f : N a R is called delta integrable function if there exists a sequence of functions { f r } , such that
Δ r f r = f , r = 1 , 2 , 3 , , n .
But, a majority of authors are paying close attention to the summation form of Equation (1). Instead of using the summation form, finding a closed form yields the discrete integration to Equation (1) in less time. This motivates us to develop the closed-form solutions for both integer- and fractional-order difference equations involving delta operators. Therefore, we employed a new approach to find these closed-form solutions, which are obtained by
a F n ( t ) : = f n ( t ) r = 0 n 1 f n r ( a ) ( t a ) ( r ) r ! .
Hence, we say (1) is summation form and (3) is closed form if f is delta integrable function. The advantage of this approach is that if the distance between a and t is sufficiently large, it will be used to accelerate computer processing when compared to the summation form (right side) of Equation (1).
In our research, we discuss two types of solutions such as closed form and summation form of ν th-order difference equations like a Δ ν g ( t ) = f ( t ) , where f is a known function. For example, when ν = 1 , f 1 ( t ) f 1 ( a ) is a closed form and s = a t 1 f ( s ) is a summation form. Here, we refer to the left side as the first-order delta integration of f and the right side as 1st-sum of f. In particular, taking f ( t ) = t ( μ ) (falling factorial functions), the delta integration of f from a to t is f 1 ( t ) f 1 ( a ) = t ( μ + 1 ) μ + 1 a ( μ + 1 ) μ + 1 (closed form) and the 1st-sum of f from a to t is s = a t 1 s ( μ ) (summation form). In this case, the corresponding first-order difference equation is Δ f 1 ( t ) = t ( μ ) . However, we found that not all functions must have delta integration; for instance, f ( t ) = 1 t , t > 0 does not have delta integration (closed form), but finite telescoping sum (1st-sum of f) is present (summation form) for that function. Therefore, if f has delta integration f 1 , we may quickly arrive at first-order fundamental theorems for delta integration that connects discrete integration and its sum.
Likewise, the second-order delta integration of f from a to t is f 2 ( t ) r = 0 1 f 2 r ( a ) ( t a ) ( r ) r ! , where f r are defined in (2), and the 2nd-sum of f from a to t is s = a t 2 ( t s 1 ) ( 1 ) f ( s ) . Similarly, the third-order delta integration of f from a to t as f 3 ( t ) r = 0 2 f 3 r ( a ) ( t a ) ( r ) r ! and the 3rd-sum of f from a to t as 1 2 ! s = a t 3 ( t s 1 ) ( 2 ) f ( s ) . In general, as a result, the nth-order fundamental theorems are obtained by connecting the nth-order delta integration from a to t (closed form) and its nth-sum (summation form). Here, we raise a question: Can we extend the nth-order delta integration to ν th-order delta integration for ν > 0 ? Later, we work towards the ν th-order delta integration. However, finding the closed form for a Δ ν presents a challenging task. For ν th-order delta integration, we apply the Newton’s formula to determine the closed-form solution. The key benefit of the ν th-order delta integration is that we have expressed the infinite series in terms of finite sums. This infinite series can be applied to any function, but the function should satisfy the -order delta integration.
Furthermore, we have extended the delta integration concept to h-delta integration, allowing us to readily identify the expression for ν th-order h-delta integration and its ν th-sum to generate discrete fundamental theorems. These fundamental theorems are verified by appropriate examples. After comprehending delta integration concepts, one can understand h-delta integration and hence, we present both concepts.
This research article is structured as follows: In Section 1, we present an introduction and the contribution of our work. In Section 2, we provide the preliminaries of delta operator and its inverse operator as they are applied to the polynomial factorial functions. For several functions, we develop the integer-order delta integration and its sum in Section 3, whereas Section 4 is concerned with fractional-order delta integration and its sum using Newton’s formula. In Section 5, we give the preliminaries of h-delta operator and its inverse h-delta operators. Section 5 focuses on integer-order h-delta integration and its sum, whereas Section 7 covers fractional order h-delta integration and its sum. Finally, Section 8 provides concluding remarks.

2. Preliminaries of Delta Operator

Basic definitions of falling factorials, the delta operator, and the summation formula derived from the inverse of the delta operator are presented in this section. It is clear that whenever f is defined on a set N a = { a , a + 1 , a + 2 , } , then Δ f is also defined on the set N a for a R = ( , ) . For similarity, throughout this paper, we use the notations: a N = { a , a 1 , a 2 , } , a + N = N a = { a , a + 1 , a + 2 , } and a ± N h = { a , a ± h , a ± 2 h , } , h ( , ) .
Definition 1.
[13] Let a ( , ) and f : a + N R . Then, the forward delta operator, denoted as Δ, is defined as
f ( t + 1 ) f ( t ) = Δ f ( t ) .
The inverse delta operator, denoted as Δ 1 , on f is defined by, if there is a function f 1 : a + 1 + N R such that Δ f 1 ( t ) = f ( t ) , then we have
Δ 1 f ( t ) = f 1 ( t ) + c : = f ( t ) Δ t ,
where c is constant and Δ 1 is a discrete integration of f for t a + 1 + N .
Definition 2.
[13] For n N and t R , the nth-falling factorial of t, denoted as t ( n ) , is defined as
t ( n ) = r = 0 n 1 ( t r ) and t ( 0 ) = 1 .
For t R , the νth-falling factorial of t, denoted as t ( ν ) , is defined by
t ( ν ) = Γ ( t + 1 ) Γ ( t + 1 ν ) ,
whenever both t ν + 1 and t + 1 { 0 , 1 , 2 , 3 , } = N ( 0 ) .
Result 1.
(Special cases) (i) 0 ( 0 ) = 1 , (ii) m ( m ) = m ! , (iii) m ( m + r ) = 0 for r = 1 , 2 , 3 , , m N ( 0 ) , (iv) t ( m ) 0 for t R N ( 0 ) and m N ( 0 ) = { 0 , 1 , 2 , } .
Definition 3.
[13] Let x R N ( 0 ) . The gamma function is then defined by
Γ ( x ) = 0 t x 1 e t d t .
It is clear that if x is any real but not a non-negative integer, then
Γ ( x ) = ( x 1 ) Γ ( x 1 ) ,
and for m N ( 1 ) , Γ ( m ) = ( m 1 ) ( m 1 ) = ( m 1 ) ! , Γ ( 1 ) = 0 e t d t = 1 .
Example 1.
Since Γ ( 0.5 ) = π , from (9) and (7), we have
(i) 
( 0.5 ) ( 1.5 ) = Γ ( 2.5 ) Γ ( 2 ) = ( 1.5 ) ( 0.5 ) Γ ( 0.5 ) = 3 4 π .
(ii) 
( 0.5 ) ( 1.5 ) = Γ ( 1.5 ) Γ ( 3 ) = ( 0.5 ) Γ ( 0.5 ) 2 = 1 4 π .
Lemma 1.
[13] Let μ > 0 , f ( t ) = t ( μ ) and t + 1 ν N ( 0 ) = { 0 , 1 , 2 , } . Then, Δ t ( μ + 1 ) = ( μ + 1 ) t ( μ ) and hence
f 1 ( t ( μ ) ) = t ( μ ) Δ t : = t ( μ + 1 ) μ + 1 + c = Δ 1 t ( μ ) .
Here, f Δ t = f 1 = Δ 1 f and the falling factorials t ( μ + 1 ) for ν > 0 are obtained by (7).
Theorem 1.
[17] (Finite Telescoping sum) Let t a + N and f : a + N R . If there is a function f 1 : a + N R such that Δ f 1 = f , then
f 1 ( t ) f 1 ( a ) = s = a t 1 f ( s ) : = a t f ( s ) Δ s .
Corollary 1.
Let t, m N , t > m and f ( t ) = t ( m ) be a falling factorial as defined in Equation (6), then
h = 0 t 1 h ( m ) = h = m t 1 h ( m ) = t ( m + 1 ) m + 1 .
Proof. 
Since 0 ( m ) , 1 ( m ) , 2 ( m ) , 3 ( m ) , , ( m 1 ) ( m ) = 0 and 0 ( m + 1 ) = 0 , the proof follows from (11) by taking f ( s ) = s ( m ) and a = 0 , and then using the Lemma 1. □
Corollary 2.
Let a R , t a + N and μ > 0 . Then, we have
a t s ( ν ) Δ s : = 1 μ + 1 t ( μ + 1 ) a ( μ + 1 ) = s = a t 1 s ( μ ) .
Proof. 
Taking f ( t ) = t ( μ ) in Lemma 1, we find f 1 ( t ) = t ( μ + 1 ) ( μ + 1 ) and f 1 ( a ) = a ( μ + 1 ) ( μ + 1 ) . Now, the proof follows by substituting f 1 ( t ) and f 1 ( a ) in (11). □
Remark 1.
In the following subsequent sections, we denote f ( t ) Δ t as Δ 1 f ( t ) and a t f ( s ) Δ s and a Δ 1 f ( t ) .

3. Integer-Order Delta Integration and Its Sum

The finite telescoping sum given by (11) is a fundamental theorem of first-order delta integration of f. In this section, we propose a main theorem connecting integer-order (nth-order) delta integration and its sum, which is an extension of (11).
Definition 4.
Let f : a + N R be referred to as an nth-order delta integrable function if a sequence of functions, say ( f 1 , f 2 , , f n ) exists, then we define Equation (2). This sequence ( f 1 , f 2 , , f n ) can be referred to as a delta integrating sequence of f.
Example 2.
Consider the following nth-order delta integrable functions, which will be used in further discussion. Here, a R and t a + N .
(i) 
For n N , the function f ( t ) = b t , b 1 is an nth-order delta integrable function, whose delta integrating sequence b t b 1 , b t ( b 1 ) 2 , , b t ( b 1 ) n satisfies the relation (2), by taking f ( t ) = b t ad f r ( t ) = b t ( b 1 ) r , since
Δ b t b 1 = Δ 2 b t ( b 1 ) 2 = = Δ n b t ( b 1 ) n = b t .
When b = 2 , f 1 ( t ) = f 2 ( t ) = f n ( t ) = f ( t ) = 2 t , since b 1 = 1 .
(ii) 
The function f ( t ) = t ( m ) , m N is an nth-order delta integrable function whose delta integrating sequence t ( m + 1 ) ( m + 1 ) ( 1 ) , t ( m + 2 ) ( m + 2 ) ( 2 ) , , t ( m + n ) ( m + n ) ( n ) satisfies the relation (2), since
Δ t ( m + 1 ) ( m + 1 ) ( 1 ) = Δ 2 t ( m + 2 ) ( m + 2 ) ( 2 ) = = Δ n t ( m + n ) ( m + n ) ( n ) = t ( m ) .
From the Example 2, we get the nth-order delta integrations for the certain functions like b t , t ( m ) and t m etc.
Definition 5.
Let n N , a R and f : a + N R be an nth-order delta integrable function, whose delta integrating sequence be ( f 1 , f 2 , , f n ) . For t a + n + N , the nth-order delta integration of f base at a is defined by (3).
The following Example 3 illustrates the Definition 5.
Example 3.
Let t N + a + n and a R . Then,
(i) 
For f ( t ) = b t and b 1 , the nth-order delta integration of b t based at a is
a F n b t : = b t ( b 1 ) n r = 0 n 1 b a ( b 1 ) n r · ( t a ) ( r ) r ! ,
In particular, when b = 2 , we find
a F n 2 t : = 2 t 2 a 1 s = 1 n 1 ( t a ) ( s ) s ! .
(ii) 
For the function f ( t ) = t ( m ) , where t N + a + n and m N , we arrive
a F n t ( m ) : = t ( m + n ) ( m + n ) ( n ) r = 0 n 1 a ( m + n r ) ( m + n r ) ( n ) · ( t a ) ( r ) r ! .
Definition 6.
[13] For ν > 0 , the νth-fractional sum of f based at a R is defined by
a Δ ν f ( t ) : = 1 Γ ( ν ) s = a t ν ( t s 1 ) ( ν 1 ) f ( s ) , t a + ν + N .
Note that when ν is a positive integer, the Γ ( ν ) can be replaced by ( ν 1 ) ! in (19).
Theorem 2.
[26] For all n N , we have
a Δ t n f ( t ) = 1 ( n 1 ) ! s = a t n ( t s 1 ) ( n 1 ) f ( s ) = s 0 = a t n s 1 = a s 0 s n 1 = a s n 2 f ( s n 1 ) ,
where s i , i = 0 , 1 , , n 1 are the summation variables.
A similar result for the above Theorem 2 is established in the following Theorem 3 using closed form of a Δ n f ( t ) .
Theorem 3.
Let a be a fixed real number. Assume that f : a + N R is a nth-order delta integrable function with integrating sequence ( f 1 , f 2 , , f n ) and a F n ( t ) is the nth-order delta integration of f based at a given in (3) and a Δ n f ( t ) be the nth-order sum of f based at a given in (19). Then, for t a + n + N , we have
f n ( t ) r = 0 n 1 f n r ( a ) ( t a ) ( r ) r ! = 1 Γ ( n ) s = a t n Γ ( t s ) Γ ( t s n + 1 ) f ( s ) .
By (3) and (19), which will be reduced into
a F n ( t ) = a Δ n f ( t ) ,
Proof. 
Since Δ f 1 = f and ( t s 1 ) ( 0 ) = 1 by finite telescoping sum, it is clear that for t a + 1 + N , we find
a F 1 ( t ) : = f 1 ( t ) f 1 ( a ) = 1 Γ ( 1 ) s = a t 1 ( t s 1 ) ( 0 ) f ( s ) = a Δ 1 f ( t ) ,
and therefore (22) is valued for n = 1 (induction method).
Assume that (22) is valued for upto ( n 1 ) t h orders. Therefore, assuming a Δ ( n 1 ) f ( t ) = a F n 1 ( t ) for t a + ( n 1 ) + N , and from Equations (3) and (19), it is obvious that
f n 1 ( t ) r = 0 n 2 f n 1 r ( a ) ( t a ) ( r ) r ! = 1 Γ ( n 1 ) r = a t ( n 1 ) ( t r 1 ) ( n 2 ) f ( s ) .
Next, we have to prove that Equation (24) should be true for n.
When t is replaced by s on the left side of Equation (24), it becomes
a F n 1 ( s ) = f n 1 ( s ) r = 0 n 2 f n 1 r ( a ) ( s a ) ( r ) r !
and taking summation from s = a to t 1 , we obtain
s = a t 1 a F n 1 ( s ) = s = a t 1 f n 1 ( s ) s = a t 1 r = 0 n 2 f n 1 r ( a ) ( s a ) ( r ) r ! ,
which is same as
s = a t 1 a F n 1 ( s ) = s = a t 1 f n 1 ( s ) r = 0 n 2 f n 1 r ( a ) s = a t 1 ( s a ) ( r ) r ! .
Since Δ f n = f n 1 , by replacing f by f n 1 and f 1 by f n in (23), the first term of the right side of Equation (25) takes the form
s = a t 1 f n 1 ( s ) = f n ( t ) f n ( a ) .
Since 0 ( r ) = 0 for r N ( 1 ) and by Equation (12), it is easy to obtain
s = a t 1 ( s a ) ( r ) r ! = ( t a ) ( r + 1 ) ( r + 1 ) ! .
Substituting (26) and (27) in (25), we find
s = 0 t 1 a F n 1 ( s ) = f n ( t ) f n ( a ) r = 0 n 2 f n 1 r ( a ) ( t a ) ( r + 1 ) ( r + 1 ) ! ,
which can be stated as
s = a t 1 a F n 1 ( s ) = f n ( t ) r = 0 n 1 f n r ( a ) ( t a ) ( r ) r ! = F a n ( t ) .
If we show that the right side of Equations (21) and (28) are the same for case n, the proof will be complete. For that, consider (24) and take t a = m and m > n . Similar result is found by Theorem 2.
Since t 1 ( n 1 ) = t n , replacing t by t 1 and a by t m in (24) gives
a F n 1 ( t 1 ) = 1 ( n 2 ) ! s = t m t n ( t s 2 ) ( n 2 ) f ( s ) .
Expanding the right-side terms of the previous equation, we arrive at
a F n 1 ( t 1 ) = 1 ( n 2 ) ! ( ( m 2 ) ( n 2 ) f ( t m ) + ( m 3 ) ( n 2 ) f ( t m + 1 )
+ ( m 4 ) ( n 2 ) f ( t m + 2 ) + + ( n 1 ) ( n 2 ) f ( t n 1 )
+ ( n 2 ) ( n 2 ) f ( t n ) ) .
Since t r ( m r ) = a , replacing t by t r and m by m r for r = 1 , 2 , 3 , , ( m 2 ) in (29), we get
a F n 1 ( t m + 1 ) = 1 ( n 2 ) ! ( n 2 ) ( 2 ) f ( t m ) ,
and a F n 1 ( t m ) = 0 , as a F n 1 ( a ) = 0 .
Since ( n 2 ) ( n 1 ) = 0 and adding all the above expressions starting from (29), we obtain
s = a t 1 a F n 1 ( s ) = 1 ( n 2 ) ! [ ( m 1 ) ( n 1 ) ( n 1 ) f ( t m ) + ( m 2 ) ( n 1 ) ( n 1 ) f ( t m + 1 ) + + ( n 1 ) ( n 1 ) ( n 1 ) f ( t n ) ] .
Substituting m = t a in the previous equation, it becomes
s = a t 1 a F n 1 ( s ) = 1 ( n 1 ) ! [ ( t a 1 ) ( n 1 ) f ( t m ) + ( t a 2 ) ( n 1 ) f ( t m + 1 )
+ + ( n 1 ) ( n 1 ) f ( t n ) ] .
The above Equation (30) is the same as
a F n ( t ) = 1 ( n 1 ) ! s = a t n ( t s 1 ) ( n 1 ) f ( s ) = a Δ n f ( t )
and the proof is completed by induction on n. □
Remark 2.
From Theorem 2 and Theorem 3, we obtain
f n ( t ) r = 0 n 1 f n r ( a ) ( t a ) ( r ) r ! = s 0 = a t n s 1 = a s 0 s n 1 = a s n 2 f ( s n 1 ) .
Corollary 3.
Let f : a + N R be nth-order delta integrable function based at a R . If t > b > a such that t belongs to both a + n + N and b + n + N , then
b Δ n f ( t ) = a F n ( t ) a F n ( b ) .
Proof. 
By replacing t by b in (22), we get
a Δ n f ( t ) = a F n ( t ) and a Δ n f ( b ) = a F n ( b ) .
Now (33) follows from b Δ n f ( t ) = a Δ n f ( t ) a Δ n f ( b ) . □
The following two examples illustrate the relation (22).
Example 4.
Consider f ( t ) = 4 t , a = 1.5 and n = 3 in Equation (22).
For t a + 3 + N , Equation (31) becomes
a Δ 3 4 t = 1 2 ! s = a t 3 ( t 1 s ) ( 2 ) 4 ( s ) .
Inserting t = 7.5 , we find
1.5 Δ 3 4 t | t = 7.5 = 1 2 s = 1.5 4.5 ( 6.5 s ) ( 2 ) 4 ( s ) 1.5 Δ 3 4 t | t = 7.5 = 1 2 5 ( 2 ) × 4 1.5 + 4 ( 2 ) × 4 2.5 + 3 ( 2 ) × 4 3.5 + 2 ( 2 ) × 4 4.5 1.5 Δ 3 4 t | t = 7.5 = 5 ( 4 ) ( 4 ) + 4 ( 3 ) ( 16 ) + 3 ( 2 ) ( 64 ) + 2 ( 1 ) ( 256 ) = 1168 .
By taking f ( t ) = 4 t , b = 4 and n = 3 in (16), we get
a F 3 ( t ) = 4 t 3 3 r = 0 2 4 a 3 3 r · ( t a ) ( r ) r ! .
If we put t = 7.5 and a = 1.5 in (35), then we obtain
1.5 F 3 ( t ) | t = 4 = 4 7.5 3 3 4 1.5 3 3 4 1.5 3 2 6 ( 1 ) 1 ! 4 1.5 3 6 ( 2 ) 2 ! = 1168 .
Thus, the relation a Δ n f ( t ) = a F n f ( t ) is verified by (34) and (36).
Example 5.
Consider the constant function f ( t ) = 1 and t a N ( 1 ) . From (2) and (10), we have
f 0 ( t ) = ( t a ) ( 0 ) , f r ( t ) = ( t a ) ( r ) r ! , f r ( a ) = 0 for r = 1 , 2 , 3 , .
Applying (37) in Theorem 3 and Corollary 3, we find a F n ( t ) = a Δ n f ( t ) and
( t a ) ( n ) n ! = 1 ( n 1 ) ! s = a t n ( t s 1 ) ( n 1 ) , t a n N ( 0 ) .
For verification, if we take t = 8.5 , n = 3 and a = 1.5 , (38) becomes
35 = 7 ( 3 ) 3 ! = 1 2 s = 1.5 5.5 ( 7.5 s ) ( 6.5 s ) = 1 2 [ 6 ( 5 ) + 5 ( 4 ) + 4 ( 3 ) + 3 ( 2 ) + 2 ( 1 ) ] = 35 .
Thus, Corollary 3 is verified for the constant function f ( t ) = 1 .
In general, for the function f ( t ) = ( t a ) ( m ) , m N , f r ( t ) = ( t a ) ( m + r ) ( m + r ) ( r ) and f r ( a ) = 0 for r = 1 , 2 , 3 , and the equation corresponding to (38) takes the form
( t a ) ( m + n ) ( m + n ) ( n ) = 1 ( n 1 ) ! s = a t n ( t s 1 ) ( n 1 ) ( s a ) ( m ) , t a n N ( 0 ) .

4. Fractional-Order Delta Integration

The expression (21) in Theorem 3 inspires us to form a fractional-order delta integration. In this section, we develop infinite ν th-order delta integrations and its sums of f based at a, respectively. The Theorems 1 and 3 yields the following definition when n takes the value fractional ν > 0 .
Definition 7.
If f : a + N R is nth-order delta integrable function based at a for every n N , then f is said to be ∞-order delta integrable function.
Example 6.
The functions b t and t ( m ) mentioned in Example 2 are ∞-order delta integrable functions, since they are nth-order delta integrable functions for every n N .
Definition 8.
Suppose we are able to find a new function a f ν : a + ν + N R depending on a and ν, whose value will be same to a Δ ν f ( t ) , then we have
a f ν ( t ) = 1 Γ ( ν ) s = a t ν Γ ( t s ) Γ ( t s + 1 ν ) f ( s ) = a Δ ν f ( t ) .
and the function a f ν is called as νth-order delta integration of f based at a.
We call that a Δ ν f ( t ) and a f ν ( t ) are ν th-order delta sum and ν th-order delta integration of f based at a, respectively. The expression of a Δ ν f ( t ) is possible for any given function f by using (19). But finding an exact (closed) function for a f ν ( t ) to a given function f is a difficult task. We obtain a f ν ( t ) ( ν > 0 , t a ν N ( 0 ) ) for certain falling factorial functions.
Conjecture 1.
Assume that f : a + N R be ∞-order delta integrable function based at a, having integrating sequence ( f n ) n = 1 . If f n ( a ) = 0 for n = 1 , 2 , 3 , , then a f ν ( t ) exists and satisfies (40) for ν > 0 and t a ν N ( 0 ) .
Example 7.
Consider the constant function f ( t ) = 1 and t a + N . Let ν > 0 and a ( , ) such that t a ν N .
Since f ( t ) = 1 = ( t a ) ( 0 ) , by Example 5 and Definition 7 f ( t ) = 1 is an ∞-order delta integrable function and having delta integrating sequence of functions { f n } , where
f n ( t ) = ( t a ) ( n ) n ! and f n ( a ) = 0 ( n ) n ! = 0 , n = 1 , 2 , 3 ,
Now, since f ( t ) = 1 satisfies the conditions of Conjecture 1, and from (41), the function a f ν is taken as
a f ν ( t ) = ( t a ) ( ν ) ν ! .
For ν > 0 and t a + ν + N , then by (7) and Definition 8, the above equation can be expressed as
a f ν ( t ) : = Γ ( t a + 1 ) Γ ( ν + 1 ) Γ ( t a + 1 ν ) = 1 Γ ( ν ) s = a t ν Γ ( t s ) Γ ( t s + 1 ν ) .
In (43), the left side and right side are ν th-order delta integration and delta sum, respectively, for the constant function f ( t ) = 1 . When t ν is very large, finding the value of left side of (43) (delta integration) is simple rather than right side of (43) (delta sum).
Since Γ ( ν + 1 ) = ν Γ ( ν ) , and t a + ν + N , Equation (43) generates a summation formula by cancelling Γ ( ν ) on both sides of (43), and putting ν ! = Γ ( ν 1 ) as
Γ ( t a + 1 ) ν ( t a ν ) ! = s = a t ν Γ ( t s ) ( t s ν ) ! .
Rewriting the right side of (44) in reverse order, it can be expressed as
s = 0 t a ν Γ ( ν + s ) s ! = Γ ( t a + 1 ) ν ( t a ν ) ! , t a ν N , ν > 0 .
If we denote t a ν = m N , (45) takes the form
s = 0 m Γ ( ν + s ) s ! = Γ ( ν + m + 1 ) ν ( m ! ) .
The Formula (46) can be proved by induction on m for given ν > 0 .
When ν = 0.5 and m = 2 , using the property n Γ ( n ) = Γ ( n + 1 ) , (46) becomes
Γ ( 0.5 ) 0 ! + Γ ( 1.5 ) 1 ! + Γ ( 2.5 ) 2 ! = Γ ( 3.5 ) 0.5 ( 2 ! ) .
Similarly, when ν = 0.3 , m = 2 , we have Γ ( 0.3 ) 0 ! + Γ ( 1.3 ) 1 ! + Γ ( 2.3 ) 2 ! = Γ ( 3.3 ) 0.3 ( 2 ! ) .
Thus, relation (46) and hence (44) are verified by the above two expressions.
Example 8.
Consider the function f ( t ) = ( t a ) ( m ) . Since Δ ν ( t a ) ( m ) m ! = ( t a ) ( m + ν ) ( m + ν ) ! and f n ( t ) = ( t a ) ( m + n ) ( m + n ) ( n ) for n = 1 , 2 , 3 , satisfies the condition of Conjecture 1, we find
a f ν ( t ) : = ( t a ) ( m + ν ) ( t + ν ) ( ν ) = 1 Γ ( ν ) s = a t ν ( t s 1 ) ( ν 1 ) ( s a ) ( m ) .
Next, we find the closed-form solution for the function 2 t . Since 2 t satisfies the condition of -order delta integration, but does not satisfy the condition given in Conjecture 1, we cannot derive the a f ν ( t ) (closed-form) solution for 2 t . As a result, we use the Discrete Newton’s formula to obtain the fractional-order ( ν t h o r d e r ) delta integration for the function 2 t .
Example 9.
(i) For the function f ( t ) = 2 t , if t a + ν + N , ν > 0 and a ( , ) . If the gamma function is valid in Δ ν 2 t = 2 a r = 0 ( t a ) ( r + ν ) ( r + ν ) and since Δ ν ( t a ) ( m ) m ! = ( t a ) ( m + ν ) ( m + ν ) ! and ( ν + 1 ) ( r + 1 ) 0 for r = 1 , 2 , , then the νth fractional integral of 2 t is obtained as
1 Γ ( ν ) s = a t ν Γ ( t s ) Γ ( t s + 1 ν ) 2 s = 2 a r = 0 ( t + a ) ( r + ν ) ( r + ν ) ! .
Using Newton’s formula, we have
f ( t ) = s = 0 Δ s f ( a ) ( t a ) ( s ) s ! .
Taking f ( t ) = 2 t in Equation (49), since 2 t = Δ 2 t = Δ 2 2 t = = Δ r 2 t , and Δ r 2 t | t = a = 2 a , we obtain
2 t = 2 a r = 0 ( t a ) ( r ) r ! .
Now multiplying the Δ ν operator on Equation (50), we get
Δ ν 2 t = 2 a r = 0 ( t a ) ( r + ν ) ( r + ν ) .
Now, (48) follows by a Δ ν f ( t ) = a f ν ( t ) and by taking f ( t ) = 2 t .
(ii) By converting factorials into gamma function in right side of Equation (48) and by (7), we get
1 Γ ( ν ) s = a t ν Γ ( t s ) Γ ( t s + 1 ν ) 2 s = 2 a Γ ( t a + 1 ) Γ ( ν + 1 ) r = 1 1 ( ν + 1 ) ( r 1 ) Γ ( t a ( ν + r 2 ) ) .
In the above Example 9, we derive the ν th-order delta integration in the form of an infinite series by applying the Discrete Newton’s formula. In that case, we say finite summation is preferable than infinite summing. The following is an verification of (52).
Verification 1.
Taking a = 0 , t = 2.5 , ν = 1.5 in (52), we arrive
1 Γ ( 1.5 ) s = 0 1 Γ ( 2.5 s ) Γ ( 2 s ) 2 s = Γ ( 3.5 ) Γ ( 2.5 ) r = 1 1 ( 2.5 ) ( r 1 ) Γ ( 3 r ) .
The left side of (53) takes the value by assuming Γ ( 0 ) and Γ ( r ) = . Therefore
Γ ( 3.5 ) Γ ( 2.5 ) 1 + 1 ( 2.5 ) = 3.5 .
Similarly, the right side of (53) takes the value
1 Γ ( 1.5 ) Γ ( 2.5 ) Γ ( 2 ) + Γ ( 1.5 ) Γ ( 1 ) ( 2 ) = 3.49999 = 3.5 .
From Equations (54) and (55), a Δ ν f ( t ) = a f ν ( t ) is verified for f ( t ) = 2 t .

5. Preliminaries for h -Delta Operator

The definition of the h-delta operator and its inverse operator are presented in this section. The first-order anti-difference principle to Δ h and their related theorems obtained here are used in the subsequent sections. For a ( , ) and a + N h { a , a + h , a + 2 h , } such that t a + N h and t ± h a + N h . Throughout this paper, we assume that h 0 is a real number and 0 N = { 0 , 1 , 2 , } .
Definition 9.
[25] Let f : a + N h R and a R . Then, the h-delta operator on f is defined by
Δ h f ( t ) = f ( t + h ) f ( t ) .
If there is a function g : a + N h R such that Δ h g ( t ) = f ( t ) , then the Inverse h-delta operator is defined by
g ( t ) = Δ h 1 f ( t ) + c ,
where c is constant
Definition 10.
[25] Let R { 0 N } denotes the set of all non-zero real integers but not negative integers and t h R { 0 N } . Then, the h-gamma function is defined as
Γ t h = 0 x t h 1 e x d x .
It is clear that, if t h { 0 , 1 , 2 , 3 , } ,
Γ t h = t h 1 Γ t h 1 ,
Definition 11.
[25] Let t , h R and n N . Then, the h-falling factorials, denoted as t h ( n ) is defined as
t h ( n ) = r = 1 n ( t r h + h ) .
Definition 12.
[27] Let ν > 0 and h , t R . If t h + 1 and t h ν + 1 do not take the negative integers, then the generalized h-falling factorial of t h ( ν ) is defined as
t h ( ν ) = Γ ( t h + 1 ) Γ ( t h ν + 1 ) h ν .
Lemma 2.
Let n N and h , t R . Then, the h-delta operator on h-falling factorial t h ( n ) is given by
Δ h t h ( n ) = ( n h ) t h ( n 1 )
and its inverse h-delta operator on t h ( n ) is given by
Δ h 1 t h ( n ) = t h ( n + 1 ) ( n + 1 ) h + c ,
where c is arbitrary constant.
Proof. 
The proof completes by taking f ( t ) = t h ( n ) in Definition 9 and then applying the Definition 11. □
Lemma 3.
Let ν > 0 and t , h R . Then, the h-delta operator on t h ( ν ) is
Δ h t h ( ν ) = Γ ( t h + 1 ) Γ ( t h ν + 2 ) ν h ν
and its inverse operator for the falling factorial is given by
Δ h 1 t h ( ν ) = h ν Γ ( t h + 1 ) ( ν + 1 ) Γ ( t h ν ) + c .
Proof. 
The proof is completed by the Definitions 10 and 12, which have the form f ( t ) = t h ( ν ) in Definition 9. □
Theorem 4.
Let f , g : a + N h R and t a h N . For t a + N h , if Δ h g ( t ) = f ( t ) then g ( t ) = Δ h 1 f ( t ) + c and
g ( t + h ) g ( a ) = s = 0 t a h f ( a + s h ) .
Proof. 
Since Δ h g ( t ) = f ( t ) , we get
g ( t + h ) = f ( t ) + g ( t ) .
Now g ( t ) , g ( t h ) , g ( t 2 h ) , g ( t 3 h ) , and g ( t m h ) are obtained by replacing t by t h , t 2 h , t 3 h , , t m h , respectively, in (67) and then substituting all these values again in (67) yields
g ( t + h ) = s = 0 m f ( t s h ) + g ( t m h ) .
Now, (66) follows by taking t m h = a in (68) and t a h = m . □
Corollary 4.
Consider the criteria in Theorem 4. Then,
Δ h 1 f ( t ) Δ h 1 f ( a ) = s = 0 t a h 1 f ( a + s h ) .
Proof. 
By replacing t with t h in Equation (68), we get
g ( t ) = f ( t h ) + f ( t 2 h ) + f ( t 3 h ) + + f ( t ( m + 1 ) h ) + g ( t ( m + 1 ) h ) .
In Equation (70), by converting t ( m + 1 ) h into t m h , then
g ( t ) = s = 1 m f ( t s h ) + g ( t m h ) .
The proof completes by taking g ( t ) = Δ h 1 f ( t ) and a = t m h . □
Remark 3.
Equation (69) can be stated as Δ h 1 f ( t ) Δ h 1 f ( a ) = Δ h 1 f ( k ) | a t
Corollary 5.
Let t , h R , such that t a h N and ν > 0 . Then,
Δ h 1 s h ( ν ) | a t = h ν Γ ( t h + 1 ) ( ν + 1 ) Γ ( t h ν ) h ν Γ ( a h + 1 ) ( ν + 1 ) Γ ( a h ν ) = s = 0 t a h 1 ( a + s h ) h ( ν ) .
Proof. 
The proof completes by taking f ( t ) = t h ( ν ) in (69) and by Equation (65). □

6. Integer-Order Delta Integration

The relations (66) as well as (69) can be considered as first-order h-delta integration of f. In this section, we propose a main theorems for nth-order h-delta integration and its sum, which is an extension of Equation (69).
Definition 13.
A function f : a + N h R is called an nth-order h-delta integrable function if there exists a sequence of functions, say ( f 1 , f 2 , , f n ) such that
Δ h r f r = f , r = 1 , 2 , 3 , , n .
The sequence ( f 1 , f 2 , , f n ) can be called as h-delta integrating sequence of f.
Example 10.
Consider the following nth-order h-delta integrable functions which are used in the further discussion.
(i) 
The function f ( t ) = b t , b 1 and t a + N h is the nth-order h-delta integrable function having integrating sequence b t ( b h 1 ) , b t ( b h 1 ) 2 , , b t ( b h 1 ) n such that
f ( t ) = b t Δ h b t ( b h 1 ) = Δ h 2 b t ( b h 1 ) 2 = = Δ h n b t ( b h 1 ) n = b t .
(ii) 
The function f ( t ) = t h ( m ) , m N and t a + N h is an nth order h-delta integrable function having integrating sequences t h ( m + 1 ) ( m + 1 ) ( 1 ) h , t h ( m + 2 ) ( k + 2 ) ( 2 ) h 2 , , t h ( m + n ) ( m + n ) ( n ) h n such that
f ( t ) = t h ( m ) Δ h t h ( m + 1 ) ( m + 1 ) ( 1 ) h = Δ h 2 t h ( m + 2 ) ( m + 2 ) ( 2 ) h 2 = = Δ h n t h ( m + n ) ( m + n ) ( n ) h n = t h ( m ) .
The functions mentioned in Example 10 are -order h-delta integrable functions.
Definition 14.
Let f : a + N h R be a h-delta integrable function having h-delta integrating sequence ( f 1 , f 2 , , f n ) . Assume that t a + N h and n N such that t a h n N . The nth-order h-delta integration of f based at a is defined by
a F h n ( t ) = f n ( t ) r = 0 n 1 f n r ( a ) r ! t a h ( r ) .
From Example 10, we get the following Example 11 for nth order h-delta integration.
Example 11.
Here, we take t a + N h such that t a h n N . Then,
(i) 
If f ( t ) = b t , b 1 and r N , then the nth-order h-delta integration of b t based at a is
a F h n ( t ) = b t ( b h 1 ) n r = 0 n 1 b a ( b h 1 ) n r r ! t a h ( r ) .
(ii) 
For the function f ( t ) = t h ( m ) , where m , n N , we have
a F h n ( t ) = t h ( m + n ) ( m + n ) ( n ) h n r = 0 n 1 a h ( m + n r ) r ! ( m + n r ) ( n r ) h n r · t a h ( r ) .
Theorem 5.
Consider the criteria given in Theorem 4 and assuming f : a + N h R having h-delta integrating sequence ( f 1 , f 2 , , f n ) . Let t a + N h and n N such that t a h n N and a Δ h n f ( t ) be the nth-order h-delta integration of f based at a, then
a Δ h n f ( t ) : = 1 ( n 1 ) ! s = 0 t a h n t a ( s + 1 ) h h ( n 1 ) f ( a + s h ) .
Proof. 
By Corollary 4, the first-order h-delta integration is proved.
Now applying the inverse h-delta operator Δ h 1 on both sides of Equation (70) yields
Δ h 2 f ( s ) | t m h t = s = 0 m Δ h 1 f ( t s h ) .
Inserting Equation (71) in each term of the right side of (80) gives
Δ h 2 f ( s ) | t m h t = f ( t 2 h ) + 2 f ( t 3 h ) + 3 f ( t 4 h ) + + ( m 1 ) f ( t m h ) + m Δ h 1 f ( t m h ) .
Putting t m h = a , we get
Δ h 2 f ( s ) | a t t a h Δ h 1 f ( t ) | a = s = 0 t a h 2 t a ( s + 1 ) h h ( 1 ) f ( a + s h ) 1 ! .
Equation (82) is the second-order h-delta integration formula.
Again, multiplying the Δ h 1 operator on two sides of Equation (81) and then proceeding with the steps from Equation (80) to (82) yields
Δ h 3 f ( s ) | a t r = 1 2 Δ h 3 r f ( t ) | a r ! t a h ( r ) = s = 0 t a h 3 t a ( s + 1 ) h h ( 2 ) f ( a + s h ) 2 ! .
Similarly applying the Δ h 1 operator repeatedly upto n 1 times and proceeding in the same manner, we will get the ( n 1 ) t h order h-delta integration as
Δ h ( n 1 ) f ( s ) | a t r = 1 n 2 Δ h n 1 r f ( t ) | a r ! t a h ( r ) = s = 0 t h a ( n 1 ) t a ( s + 1 ) h h ( n 2 ) f ( a + s h ) ( n 2 ) ! .
From Equation (84), we get the nth order delta integration as
Δ h n f ( s ) | a t r = 1 n 1 Δ h n r f ( t ) | a r ! t a h ( r ) = s = 0 t h a n t a ( s + 1 ) h h ( n 1 ) f ( a + s h ) ( n 1 ) ! .
The proof completes by taking a Δ h n f ( t ) = Δ h n f ( s ) | a t r = 1 n 1 Δ h n r f ( t ) | a r ! t a h ( r ) . □
Theorem 6.
Assume that f : a + N h R has delta integrating sequence ( f 1 , f 2 , , f n ) . Let t a + N h such that t a h n N ( 0 ) and F a n ( t ) be the nth-order h-delta integration of f based at a defined in (76). Then,
a F h n ( t ) : = 1 ( n 1 ) ! s = 0 t a h n t a ( s + 1 ) h h ( n 1 ) f ( a + s h ) .
Proof. 
Since Δ h g ( t ) = f ( t ) , t a ( s + 1 ) h h ( 0 ) = 1 by Theorem 4 and Equation (66), it is clear that for t a h N ( 1 ) ,
a F h 1 ( t ) : = Δ h 1 ( t ) Δ h 1 ( a ) = s = 0 t a h 1 t a ( s + 1 ) h h ( 0 ) f ( a + s h ) ,
and hence (86) is true for n = 1 (induction method).
Assume that (86) is accurate for ( n 1 ) t h order of h-delta integration of f based at a and t a h n + 1 N , then we get
a F h n 1 ( t ) : = Δ h n 1 f ( t ) r = 0 n 2 f n 1 r ( a ) r ! t a h ( r ) ,
which implies
a F h n 1 ( t ) = 1 ( n 2 ) ! s = 0 t a h ( n 1 ) t a ( s + 1 ) h h ( n 2 ) f ( a + s h ) .
Next, we have to prove that (88) should be true for n. Inserting the Δ h 1 operator in Equation (88), it becomes
Δ h n ( t ) Δ h n ( a ) m Δ h ( n 1 ) ( a ) m ( 2 ) 2 ! Δ h ( n 2 ) ( a ) m ( n 2 ) ( n 2 ) ! Δ h 2 ( a ) = 1 ( n 2 ) ! ( n 2 ) ( n 2 ) f 1 ( t ( n 1 ) h + ( n 1 ) ( n 2 ) f 1 ( t n h ) + + ( m 2 ) ( n 2 ) f 1 ( t ( m 1 ) h ) + ( m 1 ) ( n 2 ) f 1 ( t m h )
From Theorem 4 and Corollary 4, we arrive at
Δ h n ( t ) s = 0 n 2 m ( s ) s ! Δ h ( n s ) ( t ) | t = a = 1 ( n 1 ) ! s = 0 m n ( n s 1 ) ( n 1 ) ( n 1 ) f ( t s h ) + m ( n 1 ) ( n 1 ) f 1 ( t m h ) ,
which can be stated as,
a F h n ( t ) : = f n ( t ) r = 0 n 1 f n r ( a ) r ! t a h ( r ) = 1 ( n 1 ) ! s = 0 t a h n t a ( s + 1 ) h h ( n 1 ) f ( a + s h )
and by (76), the proof completes by induction on ’n’. □
Corollary 6.
Let n N and t a + N h such that t a h n N ( 1 ) . If f isnth-order h-delta integrable function based at a, then
a F h n ( t ) = a Δ h n f ( t ) .
Proof. 
The proof follows from Equations (79) and (86), and by Definition 14. □
Corollary 7.
Let f , g : a + N h R be nth-order h-delta integrable function based at a. If t > b > a such that both t b h n and t a h n N , then
b Δ h n f ( t ) = a F h n ( t ) a F h n ( b ) .
Proof. 
From (92), we have
a Δ h n f ( t ) = a F h n ( t ) and a Δ h n f ( b ) = a F h n ( b ) .
Now (93) follows from b Δ h n f ( t ) = a Δ h n f ( t ) a Δ h n f ( b ) . □
The following example is a verification of Corollary 6.
Example 12.
Taking f ( t ) = 4 t , a = 1.5 , n = 2 in Equation (79), then, for t a h 2 N , we have
a Δ h 2 4 t = 1 Γ ( 2 ) s = 0 t 1.5 2 2 Γ t 1.5 2 s Γ t 1.5 2 s 2 + 1 4 1.5 + 2 s .
Taking t = 7.5 and h = 2 in the above equation, we arrive
1.5 Δ 2 3 4 t | t = 7.5 = s = 0 1 Γ ( 3 s ) Γ ( 2 s ) 4 1.5 + 2 s = Γ ( 3 ) Γ ( 2 ) 4 1.5 + Γ ( 2 ) Γ ( 1 ) 4 3.5 = 144 .
By taking f ( t ) = 4 t , n = 2 and h = 2 in (77) and using the Lemma 3, we get
a F h 2 ( t ) = 4 t 15 2 r = 0 1 4 a Γ ( r + 1 ) 15 2 r · Γ ( t a 2 + 1 ) Γ ( t a 2 r + 1 ) .
If we put t = 7.5 and a = 1.5 in (95), then we obtain
1.5 F 2 2 ( 7.5 ) = 4 7.5 15 2 4 1.5 15 2 4 1.5 15 ( 3 ) = 144 .
Thus, a Δ h n f ( t ) = a F h n ( t ) is verified by (94) and (96).
Remark 4.
If we take h = 1 , then h-delta integration method is coincided with the standard delta integration.

7. Fractional-Order Delta Integration

In this section, we derive theorems and results related to ν th-order h-delta integration and finite ν th-order fractional sum of f. Theorems 5 and 6 yields the definition of -order h-delta integration and ν -th order h-delta sum.
Definition 15.
If f : a + N h R is the nth order h-delta integrable function based at a for every n N , then f is said to be ∞-order h-delta integrable function.
Definition 16.
[28] Let f : a + N h R be a function, ν > 0 and t a + N h such that t a h ν N ( 0 ) . The νth-order h-delta sum of f based at a is defined by
a Δ h ν f ( t ) : = 1 Γ ( ν ) s = 0 t a h ν Γ ( t a h s ) Γ ( t a h s ν + 1 ) f ( a + s h ) .
Definition 17.
If we are able to find a new function a f h ν : a + ν + N R depending on a and ν, whose value is equal to a Δ h ν f ( t ) , then
a f h ν ( t ) = 1 Γ ( ν ) s = 0 t a h ν Γ ( t a h s ) Γ ( t a h s ν + 1 ) f ( a + s h ) = a Δ h ν f ( t ) ,
and the function a f h ν is called as νth-order h-delta integration of f based at a.
Note that a Δ h ν f ( t ) and a f h ν ( t ) are ν th-order h-delta sum and ν th order h-delta integration of f based at a, respectively.
Conjecture 2.
Assume that f : a + N h R be ∞-order h-delta integrable function based at a having integrating sequence ( f n ) n = 1 . If f n ( a ) = 0 for n = 1 , 2 , 3 , then a f h ν ( t ) exists and satisfies (98) for ν > 0 and t a h ν N .
Example 13.
Taking the h-polynomial factorial function f ( t ) = ( t a ) h ( 2 ) , the fractional-order delta integration can be stated as follows:
a Δ h 1 f ( t ) = a f h 1 ( t ) = ( t a ) h ( 3 ) ( 3 ) h = ( t a ) h ( 3 ) ( 2 + 1 ) ( h ) ,   f 1 ( a ) = 0
a Δ h 2 f ( t ) = a f h 2 ( t ) = ( t a ) h ( 4 ) ( 4 · 3 ) h 2 = ( t a ) h ( 4 ) ( 2 + 2 ) ( 2 + 1 ) ( h 2 ) ,   f 2 ( a ) = 0
a Δ h 3 f ( t ) = a f h 3 ( t ) = ( t a ) h ( 5 ) ( 5 · 4 · 3 ) h 3 = ( t a ) h ( 5 ) ( 2 + 3 ) ( 2 + 2 ) ( 2 + 1 ) ( h 3 ) ,   f 3 ( a ) = 0
a Δ h 4 f ( t ) = a f h 4 ( t ) = ( t a ) h ( 6 ) ( 6 · 5 · 4 · 3 ) h 4 = ( t a ) h ( 6 ) ( 2 + 4 ) ( 2 + 3 ) ( 2 + 2 ) ( 2 + 1 ) ( h 4 ) ,   f 4 ( a ) = 0
and so on. Finally, we obtain the general form as
a Δ h n f ( t ) = a f h n ( t ) = ( t a ) h ( 2 + n ) ( 2 + n ) ( 2 + 3 ) ( 2 + 2 ) ( 2 + 1 ) ( h n ) = ( t a ) h ( 2 + n ) ( 2 + n ) ( n ) h n ,   f n ( a ) = 0
By Conjecture 2 for ν > 0 , a f h ν ( t ) = ( t a ) ( 2 + ν ) ( 2 + ν ) ( ν ) h ν .
By (61) and Definition 15, we get the generalized closed and summation form, which is equal to νth-order delta sum a Δ h ν f ( t ) for t a + ν h + N h as
a f h ν ( t ) : = ( t a ) h ( 2 + ν ) ( 2 + ν ) ( ν ) h ν = 1 Γ ( ν ) s = 0 t a h ν Γ ( t a h s ) Γ ( t a h s ν + 1 ) ( s h ) h ( 2 ) = a Δ ν f ( t ) .
Taking t = 6.8 , ν = 0.4 , h = 2 and a = 0 in (99), we find
( 6.8 ) 2 ( 2.4 ) ( 2.4 ) ( 0.4 ) 2 0.4 = 1 Γ ( 0.4 ) s = 0 3 ( 2.4 s ) ( 0.4 1 ) ( 2 s ) 2 ( 2 ) .
Since 0 2 ( 2 ) = 2 2 ( 2 ) = 0 , and by (61), we arrive
2 2.4 Γ ( 4.4 ) Γ ( 4 ) · Γ ( 3 ) Γ ( 3.4 ) · 1 2 0.4 = 1 Γ ( 0.4 ) Γ ( 3.4 2 ) Γ ( 4 2 ) 4 2 ( 2 ) + Γ ( 3.4 3 ) Γ ( 4 3 ) 6 2 ( 2 ) .
After simplification, it is easy to arrive
( 8 ) ( 3.4 ) ( 2.4 ) ( 1.4 ) ( 0.4 ) Γ ( 0.4 ) ( 2.4 ) ( 1.4 ) ( 0.4 ) = ( 0.4 ) Γ ( 0.4 ) ( 4 ) ( 2 ) + Γ ( 0.4 ) ( 6 ) ( 4 ) .
Now, cancelling the common factors, we get
8 ( 3.4 ) = 8 ( 0.4 ) + 8 ( 3 ) ,
which gives the validity of Equation (99).
Remark 5.
If we take h = 1 and a = 0 , then (99) is coincide with the standard delta integration.
In the following Example 14, we use the Discrete Newton’s formula to find the ν th-order delta integration for the function 2 t since it does not satisfy the conditions stated in Conjecture 2.
Example 14.
For the function f ( t ) = 2 t , if t a + N h and m N , then the mth-order h-delta integral of 2 t is obtained as
a f h m ( t ) = 2 a ( t a ) h ( 0 + m ) h 0 + m ( 0 + m ) ! + ( 2 h 1 ) ( t a ) h ( 1 + m ) h m + 1 ( 1 + m ) ! + ( 2 h 1 ) 2 ( t a ) h ( 2 + m ) h m + 2 ( 2 + m ) ! +
From Newton’s formula, we assume that
f ( t ) = a 0 + a 1 ( t a ) h ( 1 ) 1 ! + a 2 ( t a ) h ( 2 ) 2 ! + a 3 ( t a ) h ( 3 ) 3 ! + ,
where a i s to be determined.
When taking t = a in Equation (101), we get f ( a ) = a 0 .
Applying the h-delta operator Δ h on both sides of Equation (101), we get
Δ h f ( t ) = a 0 Δ h ( t a ) h ( 0 ) + a 1 Δ h ( t a ) h ( 1 ) 1 ! + a 2 Δ ( t a ) h ( 2 ) 2 ! + a 3 Δ h ( t a ) h ( 3 ) 3 ! +
Δ h f ( t ) = a 1 h + a 2 h ( t a ) h ( 1 ) 1 ! + a 3 h ( t a ) h ( 2 ) 2 ! + a 4 h ( t a ) h ( 3 ) 3 ! + a 4 h ( t a ) h ( 3 ) 3 !
From Equation (102), we obtain Δ h f ( a ) h = a 1 .
Again applying the Δ h operator in (102), we get
Δ h 2 f ( t ) = a 2 h 2 + a 3 h 2 ( t a ) h ( 1 ) 1 ! + a 4 h 2 ( t a ) h ( 2 ) 2 ! +
Hence, Δ h 2 f ( a ) h 2 = a 2 .
Proceeding in this manner, we obtain a 0 = f ( a ) , a 1 = Δ h f ( a ) h , a 2 = Δ h 2 f ( a ) h 2 , , a n = Δ h n f ( a ) h n and then substituting all these values in Equation (101), we get
f ( t ) = f ( a ) + Δ h f ( a ) h ( t a ) h ( 1 ) 1 ! + Δ h 2 f ( a ) h 2 ( t a ) h ( 2 ) 2 ! + Δ h 3 f ( a ) h 3 ( t a ) h ( 3 ) 3 ! +
In Equation (104), putting f ( t ) = 2 t , we arrive
2 t = 2 t | t = a + Δ h 2 t h | t = a ( t a ) h ( 1 ) 1 ! + Δ h 2 2 t h 2 | t = a ( t a ) h ( 2 ) 2 ! + Δ h 3 2 t h 3 | t = a ( t a ) h ( 3 ) 3 ! +
When substituting the Δ h 2 t h , Δ h 2 2 t h 2 , Δ h 3 2 t h 3 , values in Equation (105), we obtain
2 t = 2 a + 2 a ( 2 h 1 ) ( t a ) h ( 1 ) h + 2 a ( 2 h 1 ) 2 ( t a ) h ( 2 ) h 2 2 ! +
Thus,
2 t = 2 a [ 1 + ( 2 h 1 ) ( t a ) h ( 1 ) h + ( 2 h 1 ) 2 ( t a ) h ( 2 ) h 2 2 ! + ]
which can be formulated as
2 t = 2 a r = 0 ( 2 h 1 ) r ( t a ) h ( r ) h r ( r ! ) .
Now, by multiplying the Δ h 1 operator on either sides of (106), we get
Δ h 1 2 t = 2 a Δ h 1 ( t a ) h ( 0 ) ( h 0 ) ( 0 ! ) + Δ h 1 ( 2 h 1 ) ( t a ) h ( 1 ) ( h ) ( 1 ! ) + Δ h 1 ( 2 h 1 ) 2 ( t a ) h ( 2 ) ( h 2 ) ( 2 ! ) +
Δ h 1 2 t = 2 a ( t a ) h ( 1 ) ( h ) ( 1 ! ) + ( 2 h 1 ) ( t a ) h ( 2 ) ( h 2 ) ( 2 ! ) + ( 2 h 1 ) 2 ( t a ) h ( 3 ) ( h 3 ) ( 3 ! ) + .
Again multiplying the h-delta operator on either sides of (108), we grab
Δ h 2 2 t = 2 a ( 2 h 1 ) 0 ( t a ) h ( 2 ) ( h 2 ) ( 2 ! ) + ( 2 h 1 ) 1 ( t a ) h ( 3 ) ( h 3 ) ( 3 ! ) + ( 2 h 1 ) 2 ( t a ) h ( 4 ) ( h 4 ) ( 4 ! ) + .
Proceeding in this manner, and by taking a Δ h m f ( t ) = a f h m ( t ) , we get the result.
The following is a verification of Equation (107).
Verification 2.
Taking a = 2 , h = 2 , t = 6 and m = 2 in Equation (105), we get
Δ 2 2 2 t | a t = 2 a r = 2 ( 2 2 1 ) 2 r ( r ! ) 2 r ( 6 2 ) 2 ( r ) .
Using right side of (97) for r = m = 2 , the left hand side of (110) is obtained as
Δ 2 2 2 t | t = 2 6 = 2 6 ( 2 2 1 ) 2 2 2 ( 2 2 1 ) 2 2 2 ( 4 ) ( 2 2 1 ) ( 2 ) = 7.1111 0.4444 2.6667 = 4
and the right side of (110) takes the value, since 4 2 ( r ) = 0 for r 3 ,
2 2 r = 2 3 2 r 4 2 ( r ) ( r ! ) 2 r = 4 [ 4 2 ( 2 ) ( 2 ! ) 2 2 + ( 3 ) 4 2 ( 3 ) ( 3 ! ) 2 3 + ( 3 2 ) 4 2 ( 4 ) ( 4 ! ) 2 4 + ] = 4 .
Hence, (110) is verified by (111) and (112).
Result 2.
For the function f ( t ) = 2 t , and if t a h ν N , where ν > 0 , the νth-order integral of 2 t is obtained as
a f h ν ( t ) = 2 a ( t a ) h ( 0 + ν ) h 0 + ν ( 0 + ν ) ! + ( 2 h 1 ) ( t a ) h ( 1 + ν ) h ν + 1 ( 1 + ν ) ! + ( 2 h 1 ) 2 ( t a ) h ( 2 + ν ) h ν + 2 ( 2 + ν ) ! + .
Remark 6.
For ν > 0 , if t a + N h such that t a h ν N and the gamma function are valid, then we have
1 Γ ( ν ) s = 0 t a h ν Γ ( t a h s ) Γ ( t a h s ( ν 1 ) ) 2 a + s h = 2 a Γ ( t a h + 1 ) Γ ( ν + 1 ) r = 1 ( 2 h 1 ) r 1 ( ν + 1 ) ( r 1 ) Γ ( t a h ( ν + r 2 ) ) .
Proof. 
By converting the factorials into gamma function in (113), we get
Δ h ν 2 t = 2 a h ν h ν Γ ( ν + 1 ) Γ ( t a h + 1 ) Γ ( t a h ν + 1 )
+ ( 2 h 1 ) h ν + 1 h ν + 1 Γ ( ν + 2 ) Γ ( t a h + 1 ) Γ ( t a h ν ) + ( 2 h 1 ) 2 h ν + 2 h ν + 2 Γ ( ν + 3 ) Γ ( t a h + 1 ) Γ ( t a h ν 1 ) + ,
which can be written in the form
Δ h ν 2 t = 2 a Γ ( t a h + 1 ) Γ ( ν + 1 ) 1 Γ ( t a h ν + 1 ) + ( 2 h 1 ) ( ν + 1 ) 1 Γ ( t a h ν ) + ,
Hence, we obtain the equation as
Δ h ν 2 t = 2 a Γ ( t a h + 1 ) Γ ( ν + 1 ) r = 1 ( 2 h 1 ) r 1 ( ν + 1 ) ( r 1 ) Γ ( t a h ( ν + r 2 ) ) .
Inserting f ( t ) = 2 t in (97), we obtain
Δ h ν 2 t = 1 Γ ( ν ) s = 0 t a h ν Γ ( t a h s ) Γ ( t a h s ( ν 1 ) ) 2 a + s h .
By Equations (117) and (118) and then cancelling the Γ ( ν ) on both sides, we get (114). □
The following is the verification of (114).
Verification 3.
Taking a = 0 , h = 2 , t = 5 , ν = 1.5 in (114), then Equation (114) will become as
1 Γ ( 1.5 ) s = 0 2.5 1.5 Γ ( 2.5 s ) Γ ( 2 s ) 2 2 s = Γ ( 3.5 ) Γ ( 2.5 ) r = 1 3 r 1 ( 2.5 ) ( r 1 ) Γ ( 3 r ) .
The left side becomes
1 Γ ( 1.5 ) Γ ( 2.5 ) Γ ( 2 ) + Γ ( 1.5 ) Γ ( 1 ) ( 4 ) = 1.5 + 4 = 5.5 ,
and the right side becomes
Γ ( 3.5 ) Γ ( 2.5 ) 1 Γ ( 2 ) + 3 ( 2.5 ) Γ ( 1 ) = 2.5 + 3 = 5.5 .
From Equations (120) and (121), Equation (119) is verified.
Using the Discrete Newton’s formula, we obtain the ν th-order delta integration of 2 t in the form of an infinite series. From the Verification 3, the infinite summation is validated by the finite sum.
The function sin t does not satisfy the condition stated in Conjecture 2, thus we find the ν th-order delta integration for the function sin t by applying the Discrete Newton’s formula. The following Example 15 is the ν th-order delta integration for sin t .
Example 15.
For the function f ( t ) = sin t , the mth order h-delta integral of sin t is obtained as
a f h m sin t = r = 0 2 r sin r ( h / 2 ) sin ( a + r ( π / 2 + h / 2 ) ) h m + r ( m + r ) ! ( t a ) h ( m + r ) .
Applying the Δ h operator on sin t for m times, we get
Δ h m sin t = 2 m sin m ( h / 2 ) sin ( t + m ( π / 2 + h / 2 ) )
The inverse operator of (123) will be
Δ h m sin t = sin ( t m ( π / 2 + h / 2 ) ) 2 m sin m ( h / 2 ) .
Applying f ( t ) = sin t in Equation (104), we get
sin t = sin t | t = a + Δ h sin t h | t = a · ( t a ) h ( 1 ) 1 ! + Δ h 2 sin t h 2 | t = a · ( t a ) h ( 2 ) 2 ! +
Now, substituting Equation (123) for m = 1 in the above equation, we obtain
sin t = sin a + 2 sin ( h / 2 ) sin ( a + π / 2 + h / 2 ) h · ( t a ) h ( 1 ) 1 ! + 2 2 sin 2 ( h / 2 ) sin ( a + 2 ( π / 2 + h / 2 ) ) h 2 · ( t a ) h ( 2 ) 2 ! + + 2 3 sin 3 ( h / 2 ) sin ( a + 3 ( π / 2 + h / 2 ) ) h 3 · ( t a ) h ( 3 ) 3 ! +
sin t = r = 0 2 r sin r ( h / 2 ) sin ( a + r ( π / 2 + h / 2 ) ) h r ( t a ) h ( r ) r ! .
Next, applying the Δ h 1 operator on both sides of Equation (124), we get
Δ h 1 sin t = sin a Δ h 1 ( 1 ) + 2 sin ( h / 2 ) sin ( a + π / 2 + h / 2 ) h Δ h 1 ( t a ) h ( 1 ) 1 !
+ 2 2 sin 2 ( h / 2 ) sin ( a + π / 2 + h / 2 ) h Δ h 1 ( t a ) h ( 2 ) 2 ! +
Δ h 1 sin t = sin a ( t a ) h ( 1 ) h + 2 sin ( h / 2 ) sin ( a + π / 2 + h / 2 ) ( 1 ! ) h · ( t a ) h ( 2 ) 2 h
+ 2 2 sin 2 ( h / 2 ) sin ( a + π / 2 + h / 2 ) ( 2 ! ) h · ( t a ) h ( 3 ) 3 h +
Inserting the Δ h 1 operator on either sides of above equation, we get
Δ h 2 sin t = sin a h Δ h 1 ( t a ) h ( 1 ) + 2 sin ( h / 2 ) sin ( a + π / 2 + h / 2 ) ( 2 ! ) h 2 Δ h 1 ( t a ) h ( 2 )
+ 2 2 sin 2 ( h / 2 ) sin ( a + 2 ( π / 2 + h / 2 ) ) ( 3 ! ) h 3 Δ h 1 ( t a ) h ( 3 ) +
Δ h 2 sin t = sin a ( 2 ! ) h · ( t a ) h ( 2 ) h + 2 sin ( h / 2 ) sin ( a + π / 2 + h / 2 ) ( 2 ! ) h 2 · ( t a ) h ( 3 ) 3 h
+ 2 2 sin 2 ( h / 2 ) sin ( a + 2 ( π / 2 + h / 2 ) ) ( 3 ! ) h 3 · ( t a ) h ( 4 ) 4 h +
Similarly, the third-order inverse h-delta operator will be
Δ h 3 sin t = sin a ( 2 ! ) h 2 · ( t a ) h ( 3 ) 3 h + 2 sin ( h / 2 ) sin ( a + π / 2 + h / 2 ) ( 3 ! ) h 3 · ( t a ) h ( 4 ) 4 h
+ 2 2 sin 2 ( h / 2 ) sin ( a + 2 ( π / 2 + h / 2 ) ) ( 4 ! ) h 4 · ( t a ) h ( 5 ) 5 h +
Proceeding in this manner up to m times, we get
Δ h m sin t = sin a h m m ! ( t a ) h ( m ) + 2 sin ( h / 2 ) sin ( a + π / 2 + h / 2 ) h m + 1 ( m + 1 ) ! ( t a ) h ( m + 1 )
+ 2 2 sin 2 ( h / 2 ) sin ( a + 2 ( π / 2 + h / 2 ) ) h m + 2 ( m + 2 ) ! ( t a ) h ( m + 2 ) +
Hence, the result completes by taking a Δ h m = a f h m .
Result 3.
For the function f ( t ) = sin t , and if t a h ν N ( 1 ) where ν > 0 , the νth-order integral of sin t is given by
a f h ν ( t ) = r = 0 2 r sin r ( h / 2 ) sin ( a + r ( π / 2 + h / 2 ) ) h ν + r ( ν + r ) ! ( t a ) h ( ν + r ) .
Remark 7.
Consider the criteria given in (125) and if the gamma function is valid, then
1 Γ ( ν ) s = 0 t a h ν Γ ( t a h s ) Γ ( t a h s ( ν 1 ) ) sin ( a + s h )
= r = 0 2 r sin r ( h / 2 ) sin ( a + r ( π / 2 + h / 2 ) ) h ν + r ( ν + r ) ! ( t a ) h ( ν + r ) .
The following is the verification of Equation (126).
Verification 4.
Taking t = π , a = π 2 , h = π 4 such that t a h = 2 and m = 2 , then (122) becomes
1 Γ ( 2 ) s = 0 Γ ( 2 s ) Γ ( 2 s + 1 ) sin ( π / 2 + s ( π / 4 ) )
= r = 0 2 r sin r ( π / 8 ) sin ( π / 2 + r ( π / 2 + π / 8 ) ) ( π / 4 ) 2 + r ( m + r ) ! ( π ( π / 2 ) ) π / 4 ( 2 + r ) .
When solving the left side, it becomes
1 Γ ( 2 ) s = 0 Γ ( 2 s ) Γ ( 2 s + 1 ) sin ( π / 2 + s ( π / 4 ) ) = Γ ( 2 ) Γ ( 2 2 + 1 ) sin ( π / 2 ) = 1 .
Similarly, solving the right side, we get
r = 0 2 r sin r ( π / 8 ) sin ( π / 2 + r ( π / 2 + π / 8 ) ) ( π / 4 ) 2 + r ( m + r ) ! ( π ( π / 2 ) ) π / 4 ( 2 + r ) = sin ( π / 2 ) ( 2 ! ) ( π / 4 ) 2 ( π / 2 ) π / 4 ( 2 ) ,
which implies
r = 0 2 r sin r ( π / 8 ) sin ( π / 2 + r ( π / 2 + π / 8 ) ) ( π / 4 ) 2 + r ( m + r ) ! ( π ( π / 2 ) ) π / 4 ( 2 + r ) = 16 2 π 2 ( π / 2 ) ( π / 4 ) = 1 .
Hence, (127) is verified from (128) and (129).
From the Verification 3, the infinite summation of ν th-order integral of sin t of Equation (126) is validated by the finite sum.

8. Conclusions

In this paper, we derived several fundamental theorems for integer- and fractional-order discrete integration and their sums for delta integrable functions and -order delta integrable functions. Furthermore, we extended these theorems on delta integrable functions to h-delta integrable functions which provides the essential theorems using h-delta operator. Because many authors are working on delta theory, we first provide the delta integration and then extend it to the h-delta operator. These findings are analyzed and illustrated via numerical examples. The same method will be applied for the nabla operator. Our future efforts will aim to develop the fundamental theorems based on h-delta integration with several parameters for integer and ν th-fractional sum of f.

Author Contributions

Funding acquisition, M.M.A.-S.; Conceptualization, V.R.S., G.B.A.X. and D.S.; Software, M.A.; Formal analysis, P.C. and M.Z.M.A.; Methodology, M.M.A.-S. and M.Z.M.A.; Supervision, T.G.G., G.B.A.X.; Writing—original draft, V.R.S. and M.M.A.-S.; Validation, G.B.A.X. and N.A.; Writing—review and editing, T.G.G., G.B.A.X. and V.R.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by “Deanship of Scientific Research at King Khalid University” (Project under grant number (RGP.2/32/44).

Data Availability Statement

Not applicable.

Acknowledgments

The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through Large Groups (Project under grant number (RGP.2/32/44).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Kilbas, A.A.; Srivastava, H.M.; Trujillo, J.J. Theory and Applications of Fractional Differential Equations; Elsevier: Amsterdam, The Netherlands, 2006. [Google Scholar]
  2. Miller, K.S.; Ross, B. An Introduction to the Fractional Calculus and Fractional Differential Equations; John Wiley and Sons, Inc.: Hoboken, NJ, USA, 1993. [Google Scholar]
  3. Ortigueira, M.D. Fractional central differences and derivatives. J. Vib. Control 2008, 14, 1255–1266. [Google Scholar] [CrossRef]
  4. Samko, S.G.; Kilbas, A.A.; Marichev, O.I. Fractional Integrals and Derivatives; Gordon and Breach: Yverdon, Switzerland, 1993. [Google Scholar]
  5. Sathiyaraj, T.; Balasubramaniam, P. controllability of Hilfer fractional stochastic system with multiple delays and poisson jumps. Eur. Phys. J. 2019, 228, 245–260. [Google Scholar] [CrossRef]
  6. Podlubny, I. Fractional Differential Equations; Academic Press: New York, NY, USA, 1999. [Google Scholar]
  7. Podlubny, I. Fractional Differential Equations: An Introduction to Fractional Derivatives, Fractional Differential Equations to Methods of Their Solution and Some of Their Applications; Academic Press: Berkeley, CA, USA, 1998. [Google Scholar]
  8. Diaz, J.B.; Olser, T.J. Differences of Fractional Order. Math. Comput. 1974, 28, 513–529. [Google Scholar] [CrossRef]
  9. Henry, L.G.; Zhang, N. On a New Definition of the Fractional Difference. Math. Comput. 1988, 50, 513–529. [Google Scholar]
  10. Atici, F.M.; Eloe, P.W. A Transform Method in Discrete Fractional Calculus. Int. J. Differ. Eq. 2011, 2, 165–176. [Google Scholar]
  11. Atici, F.M.; Eloe, P.W. Discrete Fractional Calculus with the Nabla Operator. Electron. J. Qual. Theory Differ. 2009, 2009, 1–12. [Google Scholar] [CrossRef]
  12. Atici, F.M.; Eloe, P.W. Initial Value Problems in Discrete Fractional Calculus. Proc. Amer. Math. Soc. 2009, 137, 981–989. [Google Scholar] [CrossRef]
  13. Goodrich, C.; Peterson, A.C. Discrete Fractional Calculus; Springer International Publishing: Cham, Switzerland, 2015. [Google Scholar] [CrossRef]
  14. Hilfer, R. Applications of Fractional Calculus in Physics; World Scientific: Singapore, 2000. [Google Scholar]
  15. Kelley, W.; Peterson, A. Difference Equations: An Introduction with Application, 2nd ed.; Academic Press: New York, NY, USA, 2000. [Google Scholar]
  16. Amalraj, J.L.; Maria Susai Manuel, M.; Britto Antony Xavier, G. Summation and exact type solutions for certain type of fractional order difference equations using multi-step delta operator. Aip Conf. Proc. 2022, 2529, 020026. [Google Scholar]
  17. Baley Price, G. Telescoping Sums and the Summation of Sequences. Two Year Coll. Math. J. 1973, 4, 16–29. [Google Scholar] [CrossRef]
  18. Meganathan, M.; Vasuki, S.; Chandra Sekar, B.; Britto Antony Xavier, G. Discrete Fractional Sumudu Transform by Inverse Fractional Difference Operator. In Proceedings of the Mathematical Analysis and Computing: ICMAC 2019, Kalavakkam, India, 23–24 December 2019; Springer: Berlin/Heidelberg, Germany, 2021; pp. 247–259. [Google Scholar]
  19. Holm, M. Sum and Difference Compositions in Discrete Fractional Calculus. CUBO Math. J. 2011, 13, 153–184. [Google Scholar] [CrossRef]
  20. Oldham, K.; Spanier, J. The Fractional Calculus: Theory and Applications of Differentiation and Integration to Arbitrary Order; Dover Publications, Inc.: Mineola, NY, USA, 2002. [Google Scholar]
  21. Xavier, G.; Antony, B.; Sathinathan, T.; Arun, D. Fractional Order Riemann Zeta Factorial Function: A Recent Study. Theory Pract. Math. Comput. Sci. 2021, 10, 27–33. [Google Scholar]
  22. Maria Susai Manuel, M.; Britto Antony Xavier, G.; Chandrasekar, V. Theory and Application of the Generalized Difference Operator of the nth Kind (Part–I). Demonstr. Math. 2012, 45, 95–106. [Google Scholar] [CrossRef]
  23. Maria Susai Manuel, M.; Kilicman, A.; Britto Antony Xavier, G.; Pugalarasu, R.; Dilip, D.S. On the solutions of Second order Generalized Difference Equation. Adv. Differ. Equations 2012, 2012, 105. [Google Scholar] [CrossRef]
  24. Maria Susai Manuel, M.; Adem, K.; Britto Antony Xavier, G.; Pugalarasu, R.; Dilip, D.S. An Application on the Second order Generalized Difference Equations. Adv. Differ. Equ. 2013, 2013, 35. [Google Scholar] [CrossRef]
  25. Xavier, G.; Chandrasekar, V.; Vasanthakumar, S.U.; Govindan, B. Discrete Gamma (Factorial) Function and Its Series in Terms of a Generalized Difference Operator. Adv. Numer. Anal. 2012, 2012, 1–13. [Google Scholar] [CrossRef]
  26. Edelman, M. Fractional maps and fractional attractors. Part II: Fractional difference Caputo α-families of maps. Discontinuity Nonlinearity Complex. 2015, 4, 391–402. [Google Scholar] [CrossRef]
  27. Bastos, N.R.; Ferreira, R.A.; Torres, D.F. Discrete-time Fractional Variational Problems. Signal Process. 2011, 91, 513–524. [Google Scholar] [CrossRef]
  28. Mark, E. Maps with power-law memory: Direct introduction and Eulerian numbers, fractional maps, and fractional difference maps. In Handbook of Fractional Calculus with Applications; Walter de Gruyter GmbH: Berlin, Germany, 2019; Volume 2, pp. 47–64. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Al-Shamiri, M.M.; Rexma Sherine, V.; Britto Antony Xavier, G.; Saraswathi, D.; Gerly, T.G.; Chellamani, P.; Abdalla, M.Z.M.; Avinash, N.; Abisha, M. A New Approach to Discrete Integration and Its Implications for Delta Integrable Functions. Mathematics 2023, 11, 3872. https://doi.org/10.3390/math11183872

AMA Style

Al-Shamiri MM, Rexma Sherine V, Britto Antony Xavier G, Saraswathi D, Gerly TG, Chellamani P, Abdalla MZM, Avinash N, Abisha M. A New Approach to Discrete Integration and Its Implications for Delta Integrable Functions. Mathematics. 2023; 11(18):3872. https://doi.org/10.3390/math11183872

Chicago/Turabian Style

Al-Shamiri, Mohammed M., V. Rexma Sherine, G. Britto Antony Xavier, D. Saraswathi, T. G. Gerly, P. Chellamani, Manal Z. M. Abdalla, N. Avinash, and M. Abisha. 2023. "A New Approach to Discrete Integration and Its Implications for Delta Integrable Functions" Mathematics 11, no. 18: 3872. https://doi.org/10.3390/math11183872

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop