Next Article in Journal
Optimizing Commercial Teams and Territory Design Using a Mathematical Model Based on Clients’ Values: A Case Study in Canada
Previous Article in Journal
Existence and Uniqueness Theorem on Uncertain Nonlinear Switching Systems with Time Delay
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Multi-Delayed Discrete Matrix Functions and Their Applications in Solving Higher-Order Difference Equations

by
Ahmed M. Elshenhab
1,*,
Ghada AlNemer
2 and
Xing Tao Wang
3
1
Department of Mathematics, Faculty of Science, Mansoura University, Mansoura 35516, Egypt
2
Department of Mathematical Sciences, College of Science, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia
3
School of Mathematics, Harbin Institute of Technology, Harbin 150001, China
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(18), 2939; https://doi.org/10.3390/math13182939
Submission received: 18 August 2025 / Revised: 5 September 2025 / Accepted: 9 September 2025 / Published: 11 September 2025
(This article belongs to the Section C1: Difference and Differential Equations)

Abstract

A new class of linear non-homogeneous discrete matrix equations with multiple delays and second-order differences is considered, where the coefficient matrices satisfy pairwise permutability conditions. First, new multi-delayed discrete matrix sine- and cosine-type functions are introduced, which generalize existing delayed discrete matrix functions. Based on the introduced matrix functions and appropriate commutativity conditions, an explicit matrix representation of the solution is derived. The importance of our results is shown by comparing them with related previous works, along with suggestions about some new open problems. Finally, an example is provided to illustrate the importance of the results.

1. Introduction

Delayed discrete equations are of significant importance in both theoretical and applied mathematics, particularly in the fields of stability theory [1,2], control theory [3,4,5,6,7], dynamical systems and modeling [8], signal processing [9], and networked and distributed systems [10]. Such equations arise naturally in systems where the current state depends not only on the immediate past but also on multiple delayed states, and where second-order dynamics (involving accelerations or second differences) are present. The inclusion of matrix formulations allows for the modeling of multi-variable (vector-valued) systems, making the analysis highly relevant to real-world engineering and scientific problems.
Obtaining explicit or closed-form solutions provides deep insight into the behavior of the system and enables the precise characterization of key dynamical properties. Moreover, a powerful approach to solving initial value problems for linear discrete delay systems involves the use of delayed discrete matrix functions, which encode the system’s dynamics in a compact matrix form. For discrete systems with first-order differences, Diblík [11,12,13] investigated the solutions of equations involving a single delay, while systems with two delays and coefficient matrices that commute were studied in [14,15]. Medved’ and Pospisil [16,17] extended the analysis to discrete systems with multiple delays under the assumption of pairwise commutative matrices, while Jin and Mahmudov [18,19,20] investigated similar systems without requiring commutativity conditions, thus accommodating non-commutative matrix coefficients. For discrete systems with second-order differences, Diblík and Mencakova [21,22] investigated the representation of solutions for equations with a single delay, while Elshenhab and Wang [23] extended the analysis to systems with multiple delays, considering both permutable and nonpermutable matrix coefficients. For a comprehensive overview of the results achieved in this field, we refer to the recent article [24]. This foundational understanding has led to significant developments in stability problems [1,25,26], iterative learning control and learning analysis [3,27,28,29], and relative controllability [7,21].
Recently, Diblík [30] introduced a new class of discrete matrix equations with single delay and second-order forward difference, and derived explicit representations of their solutions. Its general form is
Δ 2 X k + S X k ω + X k ω T = Π ( k ) ,
where the independent variable k belongs to the discrete interval Z 0 , that is, k Z 0 . The set Z p q , with p q , denotes the set of all integers satisfying p k q . Cases where p = or q = are also allowed. In Equation (1), ω is a fixed positive integer known as delay, X : Z ω R n × n is the unknown matrix function, and Π : Z 0 R n × n is a given matrix-valued function. The operators Δ and Δ 2 denote the forward differences of first and second order, respectively, defined by
Δ 2 X ( k ) = Δ ( Δ X ( k ) ) = Δ ( X ( k + 1 ) X ( k ) ) = X ( k + 2 ) 2 X ( k + 1 ) + X ( k ) ,
and S , T are given constant n × n real matrices.
However, a significant challenge in the current literature is the lack of a unified framework for second-order difference equations with multiple delays. Therefore, Diblík formulated open problems aimed at extending and generalizing the results in [30] to the case of linear discrete systems with multiple delays and with coefficient matrices that are either permutable or non-permutable. This paper provides affirmative solutions to some of these open problems. Motivated by [30], we, therefore, investigate the exact solutions for a new class of matrix equations featuring multiple delays and second-order forward differences of the form
Δ 2 X k + i = 1 d S i X k ω i + X k ω i T i = Π k , X k = Ψ k , for k Z ω 1 ,
where ω i N = Z 1 are the delay parameters for i = 1 , , d , and ω : = max { ω 1 , , ω d } . The function X : Z ω R n × n denotes the unknown matrix-valued function satisfying (3) for all k Z 0 . The sequences of coefficients are given by S = ( S 1 , S 2 , , S d ) and T = ( T 1 , T 2 , , T d ) , where each S i , T i R n × n is a given constant non-zero matrix. Furthermore, Π : Z 0 R n × n is a given inhomogeneous term, and Ψ : Z ω 1 R n × n is a prescribed initial function.
The paper is structured as follows: In Section 2, we present some basic notions and lemmas, two novel multi-delayed discrete matrix functions, and their main properties used in our subsequent discussions. In Section 3, the derivation of an explicit solution to problem (3) is achieved utilizing the newly introduced multi-delayed discrete matrix functions, which form the core contribution of this paper. Finally, we present an example with simulations to exemplify our theoretical results.

2. Preliminaries

In this section, we introduce fundamental definitions and auxiliary results related to multi-delayed discrete matrix functions and discrete calculus that will be used throughout the subsequent analysis. For integers n , m Z with n m , we define the discrete intervals Z n m : = { n , n + 1 , , m } and Z n : = { n , n + 1 , } . If n > m , we set Z n m = . The n × n identity matrix and zero matrix are denoted by E and Θ , respectively. We adopt the standard convention that an empty sum i = s 1 s 2 , where s 1 > s 2 , evaluates to zero, and an empty product i = s 1 s 2 evaluates to one. When dealing with matrix operations, the empty sum yields the zero matrix Θ , and the empty product yields the identity matrix E . We define Binomial numbers by the formula
a b : = a ! b ! · ( a b ) ! if a b 0 , 0 otherwise ,
and satisfy the following identities:
a + 1 b = a b + a b 1 , a a = a 1 a 1 , a 0 = a 1 0 ,
where a, b are integers and 0 ! = 1 .
Lemma 1.
([31]). Let a, b Z , a < b . For given functions u and v, the following identities hold:
Δ k u k , r : = u k + 1 , r u k , r ,
r = a b u r Δ v r = u b v b + 1 u a v a r = a + 1 b Δ u r 1 v r ,
Δ k r = 1 k u k , r = u k + 1 , k + 1 + r = 1 k Δ k u k , r .
Definition 1.
Let  S = S 1 , , S d and  T = T 1 , , T d be n × n constant real nonzero matrices. We introduce the determining matrix equation Q S , T ( k ; i ) R n × n of the form
Q S , T ( k + 1 ; i ) = j = 1 d [ S j Q S , T ( k ; i e j ) + Q S , T ( k ; i e j ) T j ] , f o r k Z 0 , i Z 0 d ,
such that
Q S , T ( 0 ; i ) = Θ , Q S , T ( 1 ; 0 ) = E , Q S , T ( k ; 1 , i 2 , , i d ) = Q S , T ( k ; i 1 , 1 , , i d ) = = Q S , T ( k ; i 1 , i 2 , , 1 ) = Θ ,
where e j , j = 1 , , d is the canonical basis of R d .
Definition 2.
The multi-delayed discrete matrix sine-type M s S , T k , and cosine-type H c S , T k functions are defined as follows:
H c S , T k = ρ 1 , , ρ d 0 ϱ = 1 d ω ϱ + 2 ρ ϱ k 1 l k ϱ = 1 d ω ϱ ρ ϱ 2 l Q S , T ( l + 1 ; ρ ) , M s S , T k = ρ 1 , , ρ d 0 ϱ = 1 d ω ϱ + 2 ρ ϱ k 1 1 l k ϱ = 1 d ω ϱ ρ ϱ 1 + 2 l Q S , T ( l + 1 ; ρ ) ,
for any k Z ω , ρ = ρ 1 , ρ 2 , , ρ d , l = i = 1 d ρ i , and Q S , T ( l + 1 ; ρ ) is given by (4).
Lemma 2.
Let  S = S 1 , , S d  and  T = T 1 , , T d  be  n × n  constant real nonzero matrices. Then,  H c S , T k  and  M s S , T k  satisfy the following equations:
(i) 
Δ H c S , T k = j = 1 d [ S j M s S , T k ω j + M s S , T k ω j T j ] ;
(ii) 
Δ M s S , T k = H c S , T k ;
(iii) 
Δ 2 H c S , T k = j = 1 d [ S j H c S , T k ω j + H c S , T k ω j T j ] ;
(iv) 
Δ 2 M s S , T k = j = 1 d [ S j M s S , T k ω j + M s S , T k ω j T j ] .
Proof. 
It is a consequence of Definitions 1 and 2; first, we prove the identity (i) as follows:
Δ H c S , T k = H c S , T k + 1 H c S , T k = ρ 1 , , ρ d 0 ϱ = 1 d ω ϱ + 2 ρ ϱ k + 1 1 l k + 1 ϱ = 1 d ω ϱ ρ ϱ 2 l k ϱ = 1 d ω ϱ ρ ϱ 2 l Q S , T ( l + 1 ; ρ ) = ρ 1 , , ρ d 1 ϱ = 1 d ω ϱ + 2 ρ ϱ k 1 l k ϱ = 1 d ω ϱ ρ ϱ 2 l 1 Q S , T ( l + 1 ; ρ ) = j = 1 d S j ρ 1 , , ρ d 1 ϱ = 1 d ω ϱ + 2 ρ ϱ k 1 l k ϱ = 1 d ω ϱ ρ ϱ 2 l 1 Q S , T ( l ; ρ e j ) + j = 1 d ρ 1 , , ρ d 1 ϱ = 1 d ω ϱ + 2 ρ ϱ k 1 l k ϱ = 1 d ω ϱ ρ ϱ 2 l 1 Q S , T ( l ; ρ e j ) T j = j = 1 d S j ρ 1 , , ρ d 0 ϱ = 1 d ω ϱ + 2 ρ ϱ k 1 1 l k ω j ϱ = 1 d ω ϱ ρ ϱ 2 l + 1 Q S , T ( l + 1 ; ρ ) j = 1 d ρ 1 , , ρ d 0 ϱ = 1 d ω ϱ + 2 ρ ϱ k 1 1 l k ω j ϱ = 1 d ω ϱ ρ ϱ 2 l + 1 Q S , T ( l + 1 ; ρ ) T j = j = 1 d [ S j M s S , T k ω j + M s S , T k ω j T j ] .
Second, the proof of the identity (ii) becomes
Δ M s S , T k = M s S , T k + 1 M s S , T k = ρ 1 , , ρ d 0 ϱ = 1 d ω ϱ + 2 ρ ϱ k 1 l k + 1 ϱ = 1 d ω ϱ ρ ϱ 2 l + 1 k ϱ = 1 d ω ϱ ρ ϱ 2 l + 1 Q S , T ( l + 1 ; ρ ) = ρ 1 , , ρ d 0 ϱ = 1 d ω ϱ + 2 ρ ϱ k 1 l k ϱ = 1 d ω ϱ ρ ϱ 2 l Q S , T ( l + 1 ; ρ ) = H c S , T k .
Finally, using (i) and (ii), we obtain (iii) and (iv) as follows:
Δ 2 H c S , T k = Δ Δ H c S , T k = Δ j = 1 d [ S j M s S , T k ω j + M s S , T k ω j T j ] = j = 1 d [ S j H c S , T k ω j + H c S , T k ω j T j ] ,
and
Δ 2 M s S , T k = Δ Δ M s S , T k = Δ H c S , T k = j = 1 d [ S j M s S , T k ω j + M s S , T k ω j T j ] .
This completes the proof. □

3. Exact Solutions of a Multiple-Delayed Matrix Equation

In this section, we derive the representation of a solution to the problem (3) using the multi-delayed discrete matrix sine- and cosine-type functions given in Definition 2.
Theorem 1.
Let ω ϱ 1 for ϱ 1 , , d , ω : = max ω 1 , , ω d . Suppose that  S = S 1 , , S d and  T = T 1 , , T d are n × n permutable constant real nonzero matrices, Ψ k T ϱ = T ϱ Ψ k , for k Z ω 1 , and T ϱ Π k = Π k T ϱ . Then the solution X k of (3) has the form
X k = Ψ k , k Z ω 1 , H c S , T k Ψ 0 + M s S , T k Δ Ψ 0 ϱ = 1 d i = ω ϱ + 1 0 S ϱ M s S , T k ω ϱ i + M s S , T k ω ϱ i T ϱ Ψ i 1 + j = 0 k 2 M s S , T k j 1 Π j , k Z 0 .
Proof. 
Fix k Z 0 . We prove that X ( k ) , defined by (6), satisfies (3). First, if ω r 1 k < ω r 2 for each r 1 Ω 1 , r 2 Ω 2 such that Ω 1 , Ω 2 1 , 2 , , d , then
M s S , T k ω r 2 i = M s S , T k ω r 2 i , i Z ω r 2 + 1 k ω r 2 , Θ , i Z k ω r 2 + 1 0 ,
and
X k = H c S , T k Ψ 0 + M s S , T k Δ Ψ 0 r 1 Ω 1 i = ω r 1 + 1 0 S r 1 M s S , T k ω r 1 i + M s S , T k ω r 1 i T r 1 Ψ i 1 r 2 Ω 2 i = ω r 2 + 1 k ω r 2 S r 2 M s S , T k ω r 2 i + M s S , T k ω r 2 i T r 2 Ψ i 1 + j = 0 k 2 M s S , T k j 1 Π j .
Taking the first and second forward differences of (7), and applying Lemma 1, we obtain
Δ X k   = Δ H c S , T k Ψ 0 + Δ M s S , T k Δ Ψ 0 r 1 Ω 1 i = ω r 1 + 1 0 S r 1 Δ M s S , T k ω r 1 i Ψ i 1 + Δ M s S , T k ω r 1 i T r 1 Ψ i 1 r 2 Ω 2 i = ω r 2 + 1 k ω r 2 S r 2 Δ M s S , T k ω r 2 i Ψ i 1 + Δ M s S , T k ω r 2 i T r 2 Ψ i 1 + j = 0 k 2 Δ M s S , T k j 1 Π j + Π k 1 ,
and
Δ 2 X k = Δ 2 H c S , T k Ψ 0 + Δ 2 M s S , T k Δ Ψ 0 r 1 Ω 1 i = ω r 1 + 1 0 S r 1 Δ 2 M s S , T k ω r 1 i Ψ i 1 + Δ 2 M s S , T k ω r 1 i T r 1 Ψ i 1 r 2 Ω 2 i = ω r 2 + 1 k ω r 2 S r 2 Δ 2 M s S , T k ω r 2 i Ψ i 1 + Δ 2 M s S , T k ω r 2 i T r 2 Ψ i 1 r 2 Ω 2 S r 2 Ψ k ω r 2 + Ψ k ω r 2 T r 2 + j = 0 k 2 Δ 2 M s S , T k j 1 Π j + Π k ,
since M s S , T 0 = Θ , M s S , T 1 = Δ M s S , T 0 = Δ M s S , T 1 = E . In setting Π k Θ , and using Lemma 2, it follows that H c S , T ( k ) and M s S , T ( k ) are solutions of (3) that satisfy the prescribed initial conditions; specifically,
Δ 2 H c S , T k = j = 1 d [ S j H c S , T k ω j + H c S , T k ω j T j ] , Δ 2 M s S , T k = j = 1 d [ S j M s S , T k ω j + M s S , T k ω j T j ] ,
whereas H c S , T k ω r 2 = M s S , T k ω r 2 = Θ , for r 2 Ω 2 . It follows from (9) and (10) that
Δ 2 X k = p Ω 1 [ S p H c S , T k ω p + H c S , T k ω p T p ] Ψ 0 p Ω 1 [ S p M c S , T k ω p + M c S , T k ω p T p ] Δ Ψ 0 + r 1 Ω 1 i = ω r 1 + 1 0 S r 1 p Ω 1 [ S p M s S , T k ω r 1 ω p i + M s S , T k ω r 1 ω p i T p Ψ i 1 + r 1 Ω 1 i = ω r 1 + 1 0 p Ω 1 [ S p M s S , T k ω r 1 ω p i + M s S , T k ω r 1 ω p i T p T r 1 Ψ i 1 + r 2 Ω 2 i = ω r 2 + 1 0 S r 2 p Ω 1 [ S p M s S , T k ω r 2 ω p i + M s S , T k ω r 2 ω p i 1 T p Ψ i + r 2 Ω 2 i = ω r 2 + 1 0 p Ω 1 [ S p M s S , T k ω r 2 ω p i + M s S , T k ω r 2 ω p i T p T r 2 Ψ i 1 r 2 Ω 2 S r 2 Ψ k ω r 2 + Ψ k ω r 2 T r 2 j = 0 k 2 p Ω 1 [ S p M s S , T k ω p j 1 + M s S , T k ω p j 1 T p ] Π j + Π k ,
which implies that
Δ 2 X k = p Ω 1 [ S p H c S , T k ω p + H c S , T k ω p T p ] Ψ 0 p Ω 1 [ S p M c S , T k ω p + M c S , T k ω p T p ] Δ Ψ 0 + p Ω 1 r 1 Ω 1 i = ω r 1 + 1 0 S p S r 1 M s S , T k ω r 1 ω p i Ψ i 1 + S r 1 M s S , T k ω r 1 ω p i Ψ i 1 T p + p Ω 1 r 1 Ω 1 i = ω r 1 + 1 0 S p M s S , T k ω r 1 ω p i T r 1 Ψ i 1 + M s S , T k ω r 1 ω p i T r 1 Ψ i 1 T p + p Ω 1 r 2 Ω 2 i = ω r 2 + 1 0 S p S r 2 M s S , T k ω r 2 ω p i 1 Ψ i + S r 2 M s S , T k ω r 2 ω p i 1 Ψ i T p + p Ω 1 r 2 Ω 2 i = ω r 2 + 1 0 S p M s S , T k ω r 2 ω p i T r 2 Ψ i 1 + M s S , T k ω r 2 ω p i T r 2 Ψ i 1 T p r 2 Ω 2 S r 2 Ψ k ω r 2 + Ψ k ω r 2 T r 2 p Ω 1 j = 0 k 2 [ S p M s S , T k ω p j 1 Π j + M s S , T k ω p j 1 Π j T p ] + Π k .
Thus
Δ 2 X k = p Ω 1 S p X k ω p + X k ω p T p r 2 Ω 2 S r 2 Ψ k ω r 2 + Ψ k ω r 2 T r 2 + Π k .
Since k ω r 2 Z ω 1 , then Ψ k ω r 2 = X k ω r 2 for each r 2 Ω 2 . Hence
Δ 2 X k = ϱ = 1 d ( S ϱ X k ω ϱ + X k ω ϱ T ϱ ) + Π k .
Second, if Ω 2 = 1 , , d , then (11) says
Δ 2 X k = r 2 Ω 2 ( S r 2 Ψ k ω r 2 + Ψ k ω r 2 T r 2 ) + Π k = ϱ = 1 d ( S ϱ X k ω ϱ + X k ω ϱ T ϱ ) + Π k ,
for 0 k < min ϱ = 1 , , d ω ϱ . Since Ψ ( k ω ϱ ) = X ( k ω ϱ ) for each ϱ = 1 , , d , and finally, let max ϱ = 1 , , d ω ϱ k , with Ω 1 = { 1 , , d } , then (11) implies
Δ 2 X k = p Ω 1 ( S p X k ω p + X k ω p T p ) + Π k = ϱ = 1 d ( S ϱ X k ω ϱ + X k ω ϱ T ϱ ) + Π k .
This completes the proof. □
Remark 1.
Let d = 1 and ω 1 . Suppose that S and T are n × n constant real nonzero matrices. We can obtain alternative conclusions of Theorem 1 by applying summation by parts twice to the following term:
j = ω + 1 0 M s S , T k ω j Δ j 2 Ψ ( j 1 ) = M s S , T k ω Δ Ψ ( 0 ) M s S , T k 1 Δ Ψ ( ω ) + j = ω + 1 1 Δ j M s S , T k ω j 1 Δ j Ψ ( j ) = M s S , T k ω Δ Ψ ( 0 ) M s S , T k 1 Δ Ψ ( ω ) + j = ω 1 Δ j M s S , T k ω j 1 Δ j Ψ ( j ) Δ j M s S , T k 1 Δ j Ψ ( ω ) = M s S , T k ω Δ Ψ ( 0 ) M s S , T k Δ Ψ ( ω ) + j = ω 1 Δ j M s S , T k ω j 1 Δ j Ψ ( j ) = M s S , T k ω Δ Ψ ( 0 ) M s S , T k Δ Ψ ( ω ) + H c S , T k ω Ψ ( 0 ) H c S , T k 1 Ψ ( ω ) + j = ω + 1 1 Δ j 2 M s S , T k ω j Ψ ( j ) = M s S , T k ω Δ Ψ ( 0 ) M s S , T k Δ Ψ ( ω ) + H c S , T k ω Ψ ( 0 ) H c S , T k 1 Ψ ( ω ) + j = ω 1 Δ j 2 M s S , T k ω j 1 Ψ ( j ) Δ j 2 M s S , T k 1 Ψ ( ω ) = M s S , T k ω Δ Ψ ( 0 ) M s S , T k Δ Ψ ( ω ) + H c S , T k ω Ψ ( 0 ) H c S , T k Ψ ( ω ) + j = ω 1 Δ j 2 M s S , T k ω j 1 Ψ ( j ) = M s S , T k ω Δ Ψ ( 0 ) M s S , T k Δ Ψ ( ω ) + H c S , T k ω Ψ ( 0 ) H c S , T k Ψ ( ω ) j = ω + 1 0 [ S M s S , T k 2 ω j + M s S , T k 2 ω j T ) Ψ ( j 1 ) .
Hence
M s S , T k Δ Ψ ( ω ) + H c S , T k Ψ ( ω ) + j = ω + 1 0 M s S , T k ω j Δ j 2 Ψ ( j 1 ) = H c S , T k ω Ψ ( 0 ) + M s S , T k ω Δ Ψ ( 0 ) j = ω + 1 0 S M s S , T k 2 ω j + M s S , T k 2 ω j T Ψ ( j 1 ) .
Corollary 1.
Let d = 1 and ω 1 . Consider n × n constant real nonzero matrices S and T , Ψ k T = T Ψ k , for k Z ω 1 , and T Π k = Π k T . Then the solution X k of (3) can be expressed as
X k = N c k Ψ ( ω ) + N s k Δ Ψ ( ω ) + j = ω + 1 0 N s k ω j Δ j 2 Ψ ( j 1 ) + j = 0 k 2 N s k ω j 1 Π j , k Z 0 ,
or
X k = N c k ω Ψ ( 0 ) + N s k ω Δ Ψ ( 0 ) j = ω + 1 0 S N s k 2 ω j + N s k 2 ω j T Ψ ( j 1 ) + j = 0 k 2 N s k ω j 1 Π j , k Z 0 .
Proof. 
If d = 1 , then using the Binomial theorem, we have
H c S , T k = l = 0 k ω + 2 1 l k l 1 ω 2 l [ SQ S , T ( l ; l 1 ) + Q S , T ( l ; l 1 ) T ] = l = 0 k ω + 2 1 l k l 1 ω 2 l s = 0 l l s S l s T s = N c k ,
similarly,
M s S , T k = l = 0 k 1 ω + 2 1 l k l 1 ω 1 + 2 l [ SQ S , T ( l ; l 1 ) + Q S , T ( l ; l 1 ) T ] = l = 0 k 1 ω + 2 1 l k l 1 ω 1 + 2 l s = 0 l l s S l s T s = N s k ,
where N c k and N s k are the delayed discrete matrix functions defined in [30]. From the conclusion of Theorem 1 and Remark 1, we obtain (12) and (13). This ends the proof. □
Remark 2.
Corollary 1 coincides with the corresponding results in [30].
Remark 3.
If  T = Θ , and  S = S 1 , , S d are n × n permutable constant real nonzero matrices, then
H c S , Θ k = ρ 1 , , ρ d 0 ϱ = 1 d ω ϱ + 2 ρ ϱ k 1 l l ρ 1 , , ρ d k ϱ = 1 d ω ϱ ρ ϱ 2 l i = 1 d S i ρ i X k ,
and
M s S , Θ k = ρ 1 , , ρ d 0 ϱ = 1 n ω ϱ + 2 ρ ϱ k 1 1 l l ρ 1 , , ρ d k ϱ = 1 d ω ϱ ρ ϱ 1 + 2 l i = 1 d S i ρ i = Y k .
where X k and Y k are the delayed discrete matrix functions defined in [23]. In this case, our results coincide with the corresponding results in [23].
Remark 4.
If d = 1 , T = Θ , and S is an n × n constant real nonzero matrix, then
H c S , Θ k = ρ 0 ω + 2 ρ k 1 l k ω ρ 2 l Q S , Θ ( l + 1 ; ρ ) = l 0 ω + 2 l k 1 l k m l 2 l SQ S , Θ ( l ; l 1 ) = l = 0 k ω + 2 1 l k l 1 ω 2 l S l = M c k , S , ω ,
similarly,
M s S , Θ k = ρ 0 ω + 2 ρ k 1 1 l k m l 1 + 2 l Q S , Θ ( l + 1 ; ρ ) = l = 0 k 1 ω + 2 1 l k l 1 ω 1 + 2 l S l = M s k , S , ω ,
where M c k , S , ω and M s k , S , ω are the delayed discrete matrix functions defined in [22]. In this case, our results coincide with the corresponding results in [22].

4. An Example

To illustrate the validity and utility of formula (6), we provide the following example.
Example 1.
Consider the nonhomogeneous discrete matrix equation involving two delays:
Δ 2 X k + S 1 X k 1 + X k 1 T 1 + S 2 X k 2 + X k 2 T 2 = Π k , for k Z 0 , X k = Ψ k = k 0 0 k , for k Z 2 1 ,
where
S 1 = 2 0 0 2 , T 1 = 2 0 0 2 , S 2 = 0 1 1 0 , T 2 = 3 0 0 3 , Π k = 0 k + 2 k + 2 0 .
Using Definitions 1 and 2, we have
H c S , T 0 = H c S , T 1 = E , M s S , T 4 = 4 E M s S , T 0 = Θ , M s S , T 1 = E , M s S , T 2 = 2 E , M s S , T 3 = 3 E ,
for k 2 , we compute recursively:
H c S , T k = ρ 1 , ρ 2 0 3 ρ 1 + 4 ρ 2 k 1 ρ 1 + ρ 2 k ρ 1 2 ρ 2 2 ρ 1 + ρ 2 Q S , T ( ρ 1 + ρ 2 + 1 ; ρ 1 , ρ 2 ) , M s S , T k = ρ 1 , , ρ d 0 3 ρ 1 + 4 ρ 2 k 1 1 ρ 1 + ρ 2 k ρ 1 2 ρ 2 1 + 2 ρ 1 + ρ 2 Q S , T ( ρ 1 + ρ 2 + 1 ; ρ 1 , ρ 2 ) ,
where
Q S , T ( ρ 1 + ρ 2 + 1 ; ρ 1 , ρ 2 ) = [ S 1 Q S , T ( ρ 1 + ρ 2 ; ρ 1 1 , ρ 2 ) + Q S , T ( ρ 1 + ρ 2 ; ρ 1 1 , ρ 2 ) T 1 ] + [ S 2 Q S , T ( ρ 1 + ρ 2 ; ρ 1 , ρ 2 1 ) + Q S , T ( ρ 1 + ρ 2 ; ρ 1 , ρ 2 1 ) T 2 ] ,
such that
Q ( 0 ; ρ 1 , ρ 2 ) = Θ , Q ( 1 ; 0 ) = E , Q ( k ; 1 , ρ 2 ) = Q ( k ; ρ 1 , 1 ) = Θ , for k 2 .
Using Theorem 1, for k Z 2 8 , we can compute the explicit solutions X k of (14) as follows:
X k = H c S , T k Ψ 0 + M s S , T k Δ Ψ 0 S 1 M s S , T k 1 + M s S , T k 1 T 1 Ψ 1 S 2 M s S , T k 1 + M s S , T k 1 T 2 Ψ 2 S 2 M s S , T k 2 + M s S , T k 2 T 2 Ψ 1 + j = 0 k 2 M s S , T k j 1 Π j .
Under the initial conditions, the graph of the solutions X k = X 11 k X 12 k X 21 k X 22 k in Figure 1, and its values are in Table 1. Figure 1 illustrates the evolution of the four elements of the solution matrix X ( k ) from time step k = 2 to k = 8 . The plot clearly shows the dynamic, oscillatory behavior of the system introduced by the multiple delays and commutative coefficient matrices. The values in Table 1 provide a precise numerical confirmation of the solution calculated using our explicit formula (16). As shown by direct computation, the solution satisfies the equation. Additionally, from (16), we recover the initial condition X ( k ) = Ψ ( k ) for k Z 2 1 .

5. Conclusions

In this paper, a significant open problem proposed in recent literature was addressed through the extension of second-order delayed discrete matrix equations from the single-delay case to the general multiple-delay setting. Two novel multi-delayed discrete matrix functions were introduced: the multi-delayed discrete matrix cosine-type function H c S , T ( k ) and the multi-delayed discrete matrix sine-type function M s S , T ( k ) , which generalized existing delayed discrete matrix functions. These functions were shown to be crucial for solving the considered equation. Under specific commutativity conditions, an explicit representation of the solution to the initial value problem (3) was derived in Theorem 1. The generalization and extension of previous works were demonstrated through several important special cases. The practical application of the theoretical results was illustrated through a numerical example in which explicit solutions were computed and represented graphically.
The introduction of these multi-delayed discrete matrix functions was found to open new avenues for future research in stability analysis, controllability, and iterative learning control for higher-order discrete systems with multiple delays. The developed methodology was recognized as potentially extendable to systems with non-permutable matrices, time-varying coefficients, or fractional-order differences (see monograph [32]), which would further enrich the theory of discrete dynamical systems with memory effects.

Author Contributions

Conceptualization, A.M.E. and X.T.W.; data curation, A.M.E., G.A., and X.T.W.; formal analysis, A.M.E. and X.T.W.; software, A.M.E.; supervision, X.T.W.; validation, A.M.E., G.A., and X.T.W.; visualization, A.M.E.; writing—original draft, A.M.E.; writing—review and editing, A.M.E., G.A., and X.T.W.; investigation, A.M.E.; methodology, A.M.E. and X.T.W.; and funding acquisition, G.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Princess Nourah bint Abdulrahman University Researchers Supporting Project Number (PNURSP2025R45), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

Data Availability Statement

No data was used for the research described in the article.

Acknowledgments

This research was supported by Princess Nourah bint Abdulrahman University Researchers Supporting Project Number (PNURSP2025R45), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

Conflicts of Interest

The authors declare no conflicts of interest.

Glossary

  • The following table provides a comprehensive list of mathematical notations and symbols used throughout this paper:
Matrices
E Identity matrix
R n × n Set of n × n real matrices
S , T Coefficient matrix sequences ( S 1 , , S d ) , ( T 1 , , T d )
S i , T i Individual coefficient matrices ( i = 1 , , d )
P ρ S + T Permutation sum for non-commutative matrices
Θ Zero matrix
Functions
Q S , T ( k ; i ) Determining matrix equation
X ( k ) Unknown matrix-valued function
Π ( k ) Inhomogeneous term function
Ψ ( k ) Initial matrix function
Operators and Symbols
a b Binomial coefficient
Δ Forward difference operator: Δ X ( k ) = X ( k + 1 ) X ( k )
Δ 2 Second-order forward difference operator: Δ 2 X ( k ) = X ( k + 2 ) 2 X ( k + 1 ) + X ( k )
Product symbol
Summation symbol
Discrete Intervals and Sets
Empty set
N Set of natural numbers
N 0 Set of natural numbers including zero
Z 0 Set of non-negative integers
Z p Set of integers from p to infinity
Z p q Set of integers from p to q inclusive ( p q )
Z ω 1 Set of integers from ω to 1
Parameters and Indices
ρ Multi-index ( ρ 1 , , ρ d ) with ρ i 0
e j j-th canonical basis vector in R d
i Multi-index vector
ω Maximum delay: ω = max { ω 1 , , ω d }
Ω 1 , Ω 2 Index subsets of { 1 , , d }
ω i Delay parameters ( i = 1 , , d )
dNumber of delays
kDiscrete time index
lLength of multi-index: l = i = 1 d ρ i
Special Functions
H c S , T ( k ) Multi-delayed discrete matrix cosine-type function
M c ( k , S , ω ) , M s ( k , S , ω ) Delayed discrete matrix functions
M s S , T ( k ) Multi-delayed discrete matrix sine-type function
N c ( k ) , N s ( k ) Delayed discrete matrix functions (single delay case)

References

  1. Chen, Y. Representation of solutions and finite-time stability for fractional delay oscillation difference equations. Math. Methods Appl. Sci. 2024, 47, 3997–4013. [Google Scholar] [CrossRef]
  2. Huang, L.-L.; Wu, G.-C.; Luo, C. Finite-time stability of discrete fractional uncertain recurrent neural networks. Nonlinear Anal. Model. Control 2025, 30, 1–12. [Google Scholar] [CrossRef]
  3. Mahmudov, N.I.; Awadalla, M.; Arab, M. Explicit form of solutions of second-order delayed difference equations: Application to iterative learning control. Mathematics 2025, 13, 916. [Google Scholar] [CrossRef]
  4. Yang, M.; Fečkan, M.; Wang, J. Relative controllability for delayed linear discrete system with second-order differences. Qual. Theory Dyn. Syst. 2022, 21, 113. [Google Scholar] [CrossRef]
  5. Yang, M.; Fečkan, M.; Wang, J. Ulam’s type stability of delayed discrete system with second-order differences. Qual. Theory Dyn. Syst. 2024, 23, 11. [Google Scholar] [CrossRef]
  6. Diblík, J. Relative and trajectory controllability of linear discrete systems with constant coefficients and a single delay. IEEE Trans. Autom. Control 2019, 64, 2158–2165. [Google Scholar] [CrossRef]
  7. Pospíšil, M. Relative controllability of delayed difference equations to multiple consecutive states. AIP Conf. Proc. 2017, 1863, 480002. [Google Scholar] [CrossRef]
  8. Elaydi, S.N.; Cushing, J.M. Discrete Mathematical Models in Population Biology: Ecological, Epidemic, and Evolutionary Dynamics; Springer Nature: Cham, Switzerland, 2025. [Google Scholar]
  9. Williamson, D. Discrete-Time Signal Processing: An Algebraic Approach; Springer: New York, NY, USA, 2012. [Google Scholar]
  10. Li, W.; Ren, R.; Shi, M.; Lin, B.; Qin, K. Seeking secure adaptive distributed discrete-time observer for networked agent systems under external cyber attacks. IEEE Trans. Consum. Electron. 2025, in press. [Google Scholar] [CrossRef]
  11. Diblík, J. Representation of solutions to a linear matrix discrete equation with single delay. Appl. Math. Lett. 2025, 168, 109577. [Google Scholar] [CrossRef]
  12. Diblík, J.; Khusainov, D.Y. Representation of solutions of discrete delayed system x(k + 1) = Ax(k) + Bx(kω) + f(k) with commutative matrices. J. Math. Anal. Appl. 2006, 318, 63–76. [Google Scholar] [CrossRef]
  13. Diblík, J.; Khusainov, D.Y. Representation of solutions of linear discrete systems with constant coefficients and pure delay. Adv. Differ. Equ. 2006, 2006, 080825. [Google Scholar] [CrossRef]
  14. Diblík, J.; Morávková, B. Discrete matrix delayed exponential for two delays and its property. Adv. Differ. Equ. 2013, 2013, 139. [Google Scholar] [CrossRef]
  15. Diblík, J.; Morávková, B. Representation of the solutions of linear discrete systems with constant coefficients and two delays. Abstr. Appl. Anal. 2014, 2014, 320476. [Google Scholar] [CrossRef]
  16. Medved’, M.; Pospisil, M. Representation and stability of solutions of systems of difference equations with multiple delays and linear parts defined by pairwise permutable matrices. Commun. Appl. Anal. 2013, 17, 21–45. [Google Scholar]
  17. Pospisil, M. Representation of solutions of delayed difference equations with linear parts given by pairwise permutable matrices via Z-transform. Appl. Math. Comput. 2017, 294, 180–194. [Google Scholar]
  18. Jin, X.; Wang, J. Iterative learning control for linear discrete delayed systems with non-permutable matrices. Bull. Iran. Math. Soc. 2022, 28, 1553–1574. [Google Scholar] [CrossRef]
  19. Mahmudov, N.I. Delayed linear difference equations: The method of Z-transform. Electron. J. Qual. Theory Differ. Equ. 2020, 2020, 53. [Google Scholar] [CrossRef]
  20. Mahmudov, N.I. Multiple delayed linear difference equations with non-permutable matrix coefficients: The method of Z-transform. Montes Taurus J. Pure Appl. Math. 2024, 6, 138–146. [Google Scholar]
  21. Diblík, J.; Menčáková, K. A note on relative controllability of higher-order linear delayed discrete systems. IEEE Trans. Autom. Control 2020, 65, 5472–5479. [Google Scholar] [CrossRef]
  22. Diblík, J.; Menčáková, K. Representation of solutions to delayed linear discrete systems with constant coefficients and with second-order differences. Appl. Math. Lett. 2020, 105, 106309. [Google Scholar] [CrossRef]
  23. Elshenhab, A.; Wang, X.T. Representation of solutions of delayed linear discrete systems with permutable or nonpermutable matrices and second-order differences. Rev. R. Acad. Cienc. Exactas Fis. Nat. Ser. A Math. 2022, 116, 58. [Google Scholar] [CrossRef]
  24. Diblík, J. Representation of solutions of linear discrete systems with constant coefficients and with delays. Opusc. Math. 2025, 45, 145–177. [Google Scholar] [CrossRef]
  25. Medved’, M.; Škripková, L. Sufficient conditions for the exponential stability of delay difference equations with linear parts defined by permutable matrices. Electron. J. Qual. Theory Differ. Equ. 2012, 2012, 1–13. [Google Scholar] [CrossRef]
  26. Du, F.; Lu, J.-G. Exploring a new discrete delayed Mittag-Leffler matrix function to investigate finite-time stability of Riemann-Liouville fractional-order delay difference systems. Math. Methods Appl. Sci. 2022, 45, 9856–9878. [Google Scholar] [CrossRef]
  27. Liang, C.; Wang, J.; Shen, D. Iterative learning control for linear discrete delay systems via discrete matrix delayed exponential function approach. J. Differ. Equ. Appl. 2018, 24, 1756–1776. [Google Scholar] [CrossRef]
  28. Luo, H.; Wang, J.; Shen, D. Learning ability analysis for linear discrete delay systems with iteration-varying trial length. Chaos Solitons Fractals 2023, 171, 113428. [Google Scholar] [CrossRef]
  29. Yang, M.; Fečkan, M.; Wang, J. Solution to delayed linear discrete system with constant coefficients and second-order differences and application to iterative learning control. Int. J. Adapt. Control Signal Process. 2024, 38, 677–695. [Google Scholar] [CrossRef]
  30. Diblík, J. Solution of a discrete matrix equation with second-order difference and single delay. Appl. Math. Comput. 2026, 508, 129607. [Google Scholar] [CrossRef]
  31. Agarwal, R.P. Difference Equations and Inequalities: Theory, Methods, and Applications, 2nd ed.; Marcel Dekker: New York, NY, USA, 2000. [Google Scholar]
  32. Kostić, M. Almost Periodic Type Solutions to Integro-Differential-Difference Equations; De Gruyter: Berlin, Germany, 2025. [Google Scholar]
Figure 1. Evolution of matrix elements X i j ( k ) from k = 2 to k = 8 .
Figure 1. Evolution of matrix elements X i j ( k ) from k = 2 to k = 8 .
Mathematics 13 02939 g001
Table 1. X k for Figure 1.
Table 1. X k for Figure 1.
k X ( k )
2 8 4 4 8
3 18 12 12 18
4 28 24 24 28
5 35 40 40 35
6 14 42 42 14
7 73 3 3 73
8 268 140 140 268
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

Elshenhab, A.M.; AlNemer, G.; Wang, X.T. Multi-Delayed Discrete Matrix Functions and Their Applications in Solving Higher-Order Difference Equations. Mathematics 2025, 13, 2939. https://doi.org/10.3390/math13182939

AMA Style

Elshenhab AM, AlNemer G, Wang XT. Multi-Delayed Discrete Matrix Functions and Their Applications in Solving Higher-Order Difference Equations. Mathematics. 2025; 13(18):2939. https://doi.org/10.3390/math13182939

Chicago/Turabian Style

Elshenhab, Ahmed M., Ghada AlNemer, and Xing Tao Wang. 2025. "Multi-Delayed Discrete Matrix Functions and Their Applications in Solving Higher-Order Difference Equations" Mathematics 13, no. 18: 2939. https://doi.org/10.3390/math13182939

APA Style

Elshenhab, A. M., AlNemer, G., & Wang, X. T. (2025). Multi-Delayed Discrete Matrix Functions and Their Applications in Solving Higher-Order Difference Equations. Mathematics, 13(18), 2939. https://doi.org/10.3390/math13182939

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