Symmetries and Solvability of a Class of Higher Order Systems of Ordinary Difference Equations

Abstract

We perform Lie analysis for a system of higher order difference equations with variable coefficients and derive non-trivial symmetries. We use these symmetries to find exact formulas for the solutions in terms of k. Furthermore, a detailed study for a specific value of k is presented. Our findings generalize some results in the literature.

1. Introduction

A Norwegian mathematician, Marius Sophus Lie (1842–1899) is responsible for the discovery of the transformations of variables and its properties. He began by investigating the continuous groups of transformations that would leave the differential equations invariant and his work created what is now known as symmetry analysis of differential equations. Lie’s original aim was to set a general theory for the integration of ordinary differential equations which was similar to the work that was done by Galois Abel [1] on algebraic equations in 1888. During the nineteenth century, Lie developed and applied the symmetry analysis of differential equations [2]. The theory that he developed enabled one to derive the solutions of differential equations in an algorithmic way that did not require any special guesses. There has been a lot of interest in the way Lie approached differential equations and notable mentions include the work done by Sedov Leonid Ivanovich [3] and Garrett Birkhoff [4] on the dimensional analysis. Their individual work proved to be important in the understanding of Lie’s approach to differential equations because they showed that Lie’s theory gave pertinent results in applied problems. Before this, there was a German mathematician Hermann Weyl (1885–1955) who in 1928 took interest in the abstract theory of Lie groups, and the term Lie group was coined by him in the same year. There has been a restoration of interest in Lie’s theory in recent decades and during these decades there has been a lot of crucial progress that was made from an applied point of view or a theoretical one. Lie’s theory involves a lot of tedious and cumbersome calculations. Lie group analysis has been and is still an essential tool in various fields like physics, number theory, differential equations, differential geometry, analysis and more.

Many researchers have investigated the application of Lie symmetry analysis to difference equations. Systematic algorithms and methods dealing with the derivation of symmetries for difference equations are now recorded and well documented. Some of the first works can be traced back to Maeeda [5,6] who developed an algorithm for obtaining continuous point symmetries of ordinary difference equations. Levi and Winternitz [7], Hydon [8], Quispel and Sahadeva [9], among others, have greatly contributed to the use of the Lie’s theory to difference equations.

Just like differential equations, difference equations have applications in real life (simple and compound interests, loan repayments, biological population dynamics, etc.). In general, difference equations are the perfect tools for describing phenomena that happen in discrete time steps. For example, in biological populations without overlapping generations, the growth of population takes place in discrete time steps and is modeled by difference equations (see [10]). An example of a typical model is that of semelparous populations which are insect populations with a single reproductive period before death. If we denote by $N_n$ the number of adults in the nth breeding time and $a_0$ the average number of eggs laid by an adult, the model turns out to be

$$N_{n+1}=\frac{a_0{N}_n}{1+t{N}_n}$$

(1)

for some constant t. See [10] for more details. Let $\kappa$ denote the carrying capacity of the environment. Then, $t=\frac{a_0-1}{\kappa }$, and the model is known as the Beverton–Holt model [10]. Note that (1) implies that

$$N_{n+2}=\frac{N_n}{a+b{N}_n},$$

(2)

where $a=1/a_0^2$ and $b=t(a_0+1)/a_0^2$.

In [11], the authors solved and dealt with the recursive equations:

$$\begin{array}{c}\hfill x_{n+1}=\frac{x_{n-1}{y}_{n-3}}{y_{n-1}(1+x_{n-1}{y}_{n-3})},y_{n+1}=\frac{y_{n-1}{x}_{n-3}}{x_{n-1}(\pm 1\pm y_{n-1}{x}_{n-3})},\end{array}$$

(3)

where the real numbers $x_{-3},x_{-2},x_{-1},x_0,y_{-3},y_{-2},y_{-1}$ and $y_0$ are the initial conditions.

In [12], the author determined and formulated the analytical solutions of the rational recursive equations:

$$\begin{array}{c}\hfill x_{n+1}=\frac{x_{n-1}{y}_{n-3}}{y_{n-1}(\pm 1\mp x_{n-1}{y}_{n-3})},y_{n+1}=\frac{y_{n-1}{x}_{n-3}}{x_{n-1}(\mp 1\pm y_{n-1}{x}_{n-3})},\end{array}$$

(4)

where $x_{-3},x_{-2},x_{-1},x_0,y_{-3},y_{-2},y_{-1}$ and $y_0$ are the initial conditions, which are arbitrary non-zero real numbers.

Note that appropriate change of variables transform equations in (3) and (4) into equations similar to (2).

The aim of this study is to generalize the results in [11,12] by studying the system of ordinary difference equations

$$\begin{array}{c}\hfill \begin{array}{c}\hfill u_{n+1}=\frac{u_{n-1}{v}_{n-k-1}}{v_{n-k+1}(A_n+B_n{u}_{n-1}{v}_{n-k-1})},v_{n+1}=\frac{u_{n-k-1}{v}_{n-1}}{u_{n-k+1}(C_n+D_n{u}_{n-k-1}{v}_{n-1})},\end{array}\end{array}$$

(5)

where $A_n$, $B_n$, $C_n$ and $D_n$ are real sequences, using a symmetry method. Note that $u_{-k-1},\cdots$, $u_0$, $v_{-k-1},\cdots$, $v_0$ are the initial conditions. For a similar work, see [13].

Understanding Lie groups and being able to use them is important because there is a lot that can be done with Lie groups, for example, we can get the Lie algebra action for a linear object by getting the derivative of the Lie group action. This is useful because when it comes to linear objects, it is much simpler to work with a Lie algebra than directly working with a Lie group. This is just one example of the many useful ways Lie groups can be used.

2. Preliminaries

In this section, we introduce some basic definitions and theorems needed in the work. Most of our definitions can be found in [8,14].

Definition 1.

A forward OΔE has the form

$$u_{n+k}=\omega (n,u_n,u_{n+1},\cdots ,u_{n+k-1}),n\in D,$$

(6)

The domain D of the forward O$\Delta$E is said to be a regular domain if ${\omega }_{,u_n}\ne 0$, $n\in D$. Here, the notation ${\omega }_{,u_n}$ stands for $\frac{\partial \omega }{\partial u_n}$.

Definition 2.

A parametrized set of point transformations,

$${\Gamma }_{\epsilon }:\mathit{x}\mapsto \mathit{x}̂(\mathit{x};\epsilon ),\epsilon \in ({\epsilon }_0,{\epsilon }_1),$$

(7)

where ${\epsilon }_0<0<{\epsilon }_1,$ is a one-parameter local Lie group if the following conditions are satisfied:

(1)

${\Gamma }_0$is the identity map, so that$\hat{\mathit{x}}=\mathit{x}$when$\epsilon =0.$

(2)

${\Gamma }_{\delta }{\Gamma }_{\epsilon }={\Gamma }_{\delta +\epsilon }$ for every $\delta ,\epsilon$ sufficiently close to zero.

(3)

Each ${\widehat{x}}_{\alpha }$ can be represented as Taylor series in ε (in a neighborhood of $\epsilon =0$ that is determined by $\mathit{x}$), and therefore

$${\widehat{x}}_{\alpha }(\mathit{x};\epsilon )=x_{\alpha }+\epsilon {\xi }_{\alpha }\left(\mathit{x}\right)+O\left({\epsilon }^2\right),\alpha =1,\cdots ,N.$$

(8)

Definition 3.

Consider $\tilde{u}=U(u,\epsilon ),$ with $\epsilon =0,$ expand in Taylor series,

$$\tilde{u}=u+\epsilon \left(\frac{\partial U}{\partial \epsilon }{|}_{\epsilon =0}\right)+\frac{{\epsilon }^2}{2!}\left(\frac{{\partial }^{2}U}{\partial {\epsilon }^2}{|}_{\epsilon =0}\right)+\cdots$$

(9)

up to first order, we have

$$\tilde{u}=u+\epsilon \left(\frac{\partial U}{\partial \epsilon }{|}_{\epsilon =0}\right)+O\left({\epsilon }^2\right).$$

(10)

Definition 4.

A symmetry generator of (6) is denoted by U and is given by

$$U=Q\frac{\partial }{\partial u_n}+SQ\frac{\partial }{\partial u_{n+1}}+\cdots +S^{k-1}Q\frac{\partial }{\partial u_{n+k-1}},$$

(11)

where Q is the characteristic of the group of transformations.

In the above definition, $S^{j}Q(n,u_n)=Q(n+j,u_{n+j})$. The operator S is known as the shift operator.

Consider the system of ordinary difference equations of the form

$$u_{n+k+2}={\omega }_1(u_{n+k},v_n,v_{n+2}),v_{n+k+2}={\omega }_2(u_n,u_{n+2},v_{n+k}),$$

(12)

where the independent variable is n and the dependent variables are $u_n$, $v_n$ and their shifts.

Consider the group of transformations

$$\begin{array}{cc}\hfill (n,u_n,v_n)\mapsto (n,{\tilde{u}}_n=u_n+\epsilon Q_1(n,u_n)& \\ \hfill +O\left({\epsilon }^2\right),{\tilde{v}}_n=v_n+\epsilon Q_2(n,v_n)+& O\left({\epsilon }^2\right)).\hfill \end{array}$$

(13)

In (13), the characteristic of the group of transformations is $Q=(Q_1,Q_2)$. The infinitesimal generator corresponds to

$$U=Q_1{\partial }_{u_n}+Q_2{\partial }_{v_n},$$

(14)

where ${\partial }_x=\frac{\partial }{\partial x}$. In this work, we will need the kth extension

$$\begin{array}{c}\hfill U^{\left[k\right]}=Q_1{\partial }_{u_n}+Q_2{\partial }_{v_n}+S^2{Q}_1{\partial }_{u_{n+2}}+S^2{Q}_2{\partial }_{v_{n+2}}+S^k{Q}_1{\partial }_{u_{n+k}}+S^k{Q}_2{\partial }_{v_{n+k}}\end{array}$$

(15)

of (14).

For the set of solutions of (12) to be mapped to itself, the following linearized symmetry conditions

$$S^{(k+2)}{Q}_1-U^{\left[k\right]}{\omega }_1=0\mathrm{and}{S}^{(k+2)}{Q}_2-U^{\left[k\right]}{\omega }_2=0,$$

(16)

whenever (12) is true, must be satisfied. If the conditions given in (16), that is, $Q_j(n+k+2,{\Omega }_j)-U^{\left[k\right]}\left({\Omega }_j\right)=0,$$j=1,2,$ are satisfied, then the group of transformations (13) is a symmetry group.

3. Symmetries and Solutions of the System of Difference Equations

Equivalently, Equation (5) can be written as

$$\begin{array}{c}\hfill \begin{array}{cc}\hfill u_{n+k+2}=& {\omega }_1=\frac{u_{n+k}{v}_n}{v_{n+2}(a_n+b_n{u}_{n+k}{v}_n)},\hfill \\ \hfill v_{n+k+2}=& {\omega }_2=\frac{u_n{v}_{n+k}}{u_{n+2}(c_n+d_n{u}_n{v}_{n+k})},\hfill \end{array}\end{array}$$

(17)

where $a_n$, $b_n$, $c_n$ and $d_n$ are real sequences. Applying (16) to (17) yields

$$\begin{array}{c}\hfill -S^{k+2}{Q}_1+\frac{a_n{u}_{n+k}{Q}_2}{v_{n+2}{(a_n+b_n{u}_{n+k}{v}_n)}^2}-\\ \hfill \frac{u_{n+k}{v}_n{S}^2{Q}_2}{v_{n+2}^2(a_n+b_n{u}_{n+k}{v}_n)}+\frac{a_n{v}_n{S}^k{Q}_1}{v_{n+2}{(a_n+b_n{u}_{n+k}{v}_n)}^2}=0,\end{array}$$

(18)

$$\begin{array}{c}\hfill -S^{k+2}{Q}_2+\frac{c_n{v}_{n+k}{Q}_1}{u_{n+2}{(c_n+d_n{u}_n{v}_{n+k})}^2}-\\ \hfill \frac{u_n{v}_{n+k}{S}^2{Q}_1}{u_{n+2}^2(c_n+d_n{u}_n{v}_{n+k})}+\frac{c_n{u}_n{S}^k{Q}_2}{u_{n+2}{(c_n+d_n{u}_n{v}_{n+k})}^2}=0.\end{array}$$

(19)

After a set of long calculations, we get a system of determining equations for the characteristics $Q_1$ and $Q_2$. Solving this system, we get

$$\begin{array}{c}\hfill Q_2(n,v_n)={\lambda }_n{v}_n\mathrm{and}{Q}_1(n,u_n)={\alpha }_n{u}_n,\end{array}$$

(20)

provided that

$$\begin{array}{c}\hfill {\alpha }_n+{\lambda }_{n+k}=0\mathrm{and}{\lambda }_n+{\alpha }_{n+k}=0.\end{array}$$

(21)

Using (21), we have that

$$\begin{array}{c}\hfill {\alpha }_{n+2k}-{\alpha }_n=0.\end{array}$$

(22)

The characteristic equation corresponding to (22) is giving by

$$\begin{array}{c}\hfill r^{2k}-1=0.\end{array}$$

(23)

Basically, r are the $2k$-th roots of 1, which are obtained as follows:

$$\begin{array}{cc}\hfill r^{2k}=& e^{i(0+2p\pi )},\hfill \end{array}$$

(24)

that is,

$$\begin{array}{cc}\hfill r=& e^{i\left(\frac{2p\pi }{2k}\right)}\hfill \end{array}$$

(25)

for any $2k$ successive values of $p\in \mathbb{Z}$, say $0\le p\le 2k-1$. This is the same as saying that

$$\begin{array}{cc}\hfill r=& e^{i\left(\frac{p\pi }{k}\right)},0\le p\le 2k-1.\hfill \end{array}$$

(26)

It follows that the solutions ${\alpha }_n$ of (22) are given by

$$\begin{array}{cc}\hfill {\alpha }_n=& r^n=e^{i\left(\frac{np\pi }{k}\right)},0\le p\le 2k-1.\hfill \end{array}$$

(27)

Using (21), we have that

$$\begin{array}{cc}\hfill {\lambda }_n=& -{\alpha }_{n+k}\hfill \\ \hfill =& -e^{\frac{i(n+k)p\pi }{k}},0\le p\le 2k-1.\hfill \end{array}$$

(28)

Therefore (thanks to (14), (20), (27) and (28)), the system (17) has the following $2k$ symmetry generators:

$$\begin{array}{cc}\hfill U=& e^{ip\pi n/k}{u}_n\frac{\partial }{\partial u_n}-e^{ip\pi (n+k)/k}{v}_n\frac{\partial }{\partial v_n},\hfill \end{array}$$

(29)

where $0\le p\le 2k-1$. Thanks to (20), the canonical coordinates [15] are given by

$$\begin{array}{c}\hfill s_n^1=\int \frac{d{u}_n}{Q_1(n,u_n)}=\frac{1}{{\alpha }_n}ln|u_n|\mathrm{and}{s}_n^2=\int \frac{d{v}_n}{Q_2(n,v_n)}=\frac{1}{{\lambda }_n}ln\left|v_n\right|.\end{array}$$

(30)

Motivated by (21), we let ${\tilde{Y}}_n={\alpha }_n{s}_n^1+{\lambda }_{n+k}{s}_{n+k}^2=ln\left|u_n{v}_{n+k}\right|$ and ${\tilde{X}}_n={\lambda }_n{s}_n^2+{\alpha }_{n+k}{s}_{n+k}^1=ln\left|v_n{u}_{n+k}\right|$. For a better understanding, we use $X_n=exp\{-{\tilde{X}}_n\}\mathrm{and}{Y}_n=exp\{-{\tilde{Y}}_n\}$. We then get the invariants

$$\begin{array}{c}\hfill X_n=\frac{1}{v_n{u}_{n+k}}\mathrm{and}{Y}_n=\frac{1}{u_n{v}_{n+k}}.\end{array}$$

(31)

Here, (31) is invariant under the group transformations of (20). In other words, the action of the symmetry generators, given in (29), on (31) gives zero. It is worthwhile mentioning that the symmetries together with the constraints on ${\alpha }_n$ and ${\lambda }_n$ have helped us to come up with the appropriate change of variables that will lead to the reduced system of equations. This is just one of the many roles of symmetries.

Using (31), (5) is reduced to a second-order difference equations:

$$\begin{array}{c}\hfill X_{n+2}=a_n{X}_n+b_n\mathrm{and}{Y}_{n+2}=c_n{Y}_n+d_n.\end{array}$$

(32)

The closed form solutions of (32) are, respectively, as follows:

$$\begin{array}{c}\hfill X_{2n+i}=X_i\left(\prod _{k_1=0}^{n-1}{a}_{2k_1+i}\right)+\sum _{l=0}^{n-1}\left(b_{2l+i}\prod _{k_2=l+1}^{n-1}{a}_{2k_2+i}\right),\end{array}$$

(33)

$$\begin{array}{c}\hfill Y_{2n+i}=Y_i\left(\prod _{k_1=0}^{n-1}{c}_{2k_1+i}\right)+\sum _{l=0}^{n-1}\left(d_{2l+i}\prod _{k_2=l+1}^{n-1}{c}_{2k_2+i}\right),\end{array}$$

(34)

for $i=0,1.$

From (31), we get that

$$\begin{array}{c}\hfill u_{n+2k}=\frac{Y_n}{X_{n+k}}{u}_n\mathrm{and}{v}_{n+2k}=\frac{X_n}{Y_{n+k}}{v}_n.\end{array}$$

(35)

Performing iterations on (35), respectively, leads to the following:

$$\begin{array}{c}\hfill u_{2kn+j}=u_j\prod _{m=0}^{n-1}\frac{Y_{2km+j}}{X_{2km+k+j}}\mathrm{and}{v}_{2kn+j}=v_j\prod _{m=0}^{n-1}\frac{X_{2km+j}}{Y_{2km+k+j}},\end{array}$$

(36)

where $j=0,1,2,\cdots ,2k-1.$

The subscript of $X\mathrm{and}Y$ in (33) and (34) is $2n+1,$ where $i=0,1$ but the ones of $X\mathrm{and}Y$ in (36) are $2km+j\mathrm{and}2km+k+j,$ where $j=0,1,2,\cdots ,2k-1$. Therefore, we want to write $2km+j\mathrm{and}2km+k+j$ in the form similar to $2n+i.$ We know that any positive integer r can be written as $r=k\lfloor r/k\rfloor +\tau \left(r\right)$, $0\le \tau \left(r\right)\le k-1$, where $\tau \left(r\right)$ denotes the remainder when r is divided by k. Hence,

$$\begin{array}{c}\hfill 2km+j=2\left(km+⌊\frac{j}{2}⌋\right)+\tau \left(j\right)\end{array}$$

(37)

and

$$\begin{array}{c}\hfill 2km+k+j=2\left(km+⌊\frac{k+j}{2}⌋\right)+\tau (k+j).\end{array}$$

(38)

Now, (37) and (38) are of the form similar to $2n+i,\mathrm{as}\tau \left(j\right)\mathrm{and}\tau (k+j)$ will either be 0 or 1. Substituting (37) and (38) into (36) leads to the following:

$$\begin{array}{c}\hfill u_{2kn+j}=u_j\prod _{m=0}^{n-1}\frac{Y_{2(km+\lfloor \frac{j}{2}\rfloor )+\tau \left(j\right)}}{X_{2(km+\lfloor \frac{k+j}{2}\rfloor )+\tau (k+j)}}\end{array}$$

(39)

and

$$\begin{array}{c}\hfill v_{2kn+j}=v_j\prod _{m=0}^{n-1}\frac{X_{2(km+\lfloor \frac{j}{2}\rfloor )+\tau \left(j\right)}}{Y_{2(km+\lfloor \frac{k+j}{2}\rfloor )+\tau (k+j)}}.\end{array}$$

(40)

Using (33), (34) (39) and (40), we get the following:

$$\begin{array}{cc}\hfill & u_{2kn+j}=u_j\prod _{m=0}^{n-1}\hfill \\ & \frac{Y_{\tau \left(j\right)}\left[\left(\prod _{k_1=0}^{\begin{array}{c}km+\\ \lfloor \frac{j}{2}\rfloor -1\end{array}}{c}_{2k_1+\tau \left(j\right)}\right)+\frac{1}{Y_{\tau \left(j\right)}}\sum _{l=0}^{\begin{array}{c}km+\\ \lfloor \frac{j}{2}\rfloor -1\end{array}}\left(d_{2l+\tau \left(j\right)}\prod _{k_2=l+1}^{\begin{array}{c}km+\\ \lfloor \frac{j}{2}\rfloor -1\end{array}}{c}_{2k_2+\tau \left(j\right)}\right)\right]}{X_{\tau (k+j)}\left[\left(\prod _{k_1=0}^{\begin{array}{c}km+\\ \lfloor \frac{k+j}{2}\rfloor -1\end{array}}{a}_{2k_1+\tau (k+j)}\right)+\frac{1}{X_{\tau (k+j)}}\sum _{l=0}^{\begin{array}{c}km+\\ \lfloor \frac{k+j}{2}\rfloor -1\end{array}}\left(b_{2l+\tau (k+j)}\prod _{k_2=l+1}^{\begin{array}{c}km+\\ \lfloor \frac{k+j}{2}\rfloor -1\end{array}}{a}_{2k_2+\tau (k+j)}\right)\right]},\hfill \end{array}$$

that is,

$$\begin{array}{cc}\hfill & u_{2kn+j}=u_j\prod _{m=0}^{n-1}\frac{u_{\tau (k+j)+k}{v}_{\tau (k+j)}}{u_{\tau \left(j\right)}{v}_{\tau \left(j\right)+k}}\hfill \\ & \frac{\left(\prod _{k_1=0}^{\begin{array}{c}km+\\ \lfloor \frac{j}{2}\rfloor -1\end{array}}{c}_{2k_1+\tau \left(j\right)}\right)+u_{\tau \left(j\right)}{v}_{\tau \left(j\right)+k}\sum _{l=0}^{\begin{array}{c}km+\\ \lfloor \frac{j}{2}\rfloor -1\end{array}}\left(d_{2l+\tau \left(j\right)}\prod _{k_2=l+1}^{\begin{array}{c}km+\\ \lfloor \frac{j}{2}\rfloor -1\end{array}}{c}_{2k_2+\tau \left(j\right)}\right)}{\left(\prod _{k_1=0}^{\begin{array}{c}km+\\ \lfloor \frac{k+j}{2}\rfloor -1\end{array}}{a}_{2k_1+\tau (k+j)}\right)+u_{\tau (k+j)+k}{v}_{\tau (k+j)}\sum _{l=0}^{\begin{array}{c}km+\\ \lfloor \frac{k+j}{2}\rfloor -1\end{array}}\left(b_{2l+\tau (k+j)}\prod _{k_2=l+1}^{\begin{array}{c}km+\\ \lfloor \frac{k+j}{2}\rfloor -1\end{array}}{a}_{2k_2+\tau (k+j)}\right)}\hfill \end{array}$$

(41)

and, similarly,

$$\begin{array}{cc}\hfill & v_{2kn+j}=v_j\prod _{m=0}^{n-1}\frac{u_{\tau (k+j)}{v}_{\tau (k+j)+k}}{u_{\tau \left(j\right)+k}{v}_{\tau \left(j\right)}}\hfill \\ & \frac{\left(\prod _{k_1=0}^{\begin{array}{c}km+\\ \lfloor \frac{j}{2}\rfloor -1\end{array}}{a}_{2k_1+\tau \left(j\right)}\right)+u_{\tau \left(j\right)+k}{v}_{\tau \left(j\right)}\sum _{l=0}^{\begin{array}{c}km+\\ \lfloor \frac{j}{2}\rfloor -1\end{array}}\left(b_{2l+\tau \left(j\right)}\prod _{k_2=l+1}^{\begin{array}{c}km+\\ \lfloor \frac{j}{2}\rfloor -1\end{array}}{a}_{2k_2+\tau \left(j\right)}\right)}{\left(\prod _{k_1=0}^{\begin{array}{c}km+\\ \lfloor \frac{k+j}{2}\rfloor -1\end{array}}{c}_{2k_1+\tau (k+j)}\right)+u_{\tau (k+j)}{v}_{\tau (k+j)+k}\sum _{l=0}^{\begin{array}{c}km+\\ \lfloor \frac{k+j}{2}\rfloor -1\end{array}}\left(d_{2l+\tau (k+j)}\prod _{k_2=l+1}^{\begin{array}{c}km+\\ \lfloor \frac{k+j}{2}\rfloor -1\end{array}}{c}_{2k_2+\tau (k+j)}\right)}.\hfill \end{array}$$

(42)

Back-shifting the equations above by k yields

$$\begin{array}{cc}\hfill & u_{2kn+j-k}=u_{j-k}\prod _{m=0}^{n-1}\frac{u_{\tau (k+j)}{v}_{\tau (k+j)-k}}{u_{\tau \left(j\right)-k}{v}_{\tau \left(j\right)}}\hfill \\ & \frac{\left(\prod _{k_1=0}^{\begin{array}{c}km+\\ \lfloor \frac{j}{2}\rfloor -1\end{array}}{C}_{2k_1+\tau \left(j\right)}\right)+u_{\tau \left(j\right)+(-k)}{v}_{\tau \left(j\right)}\sum _{l=0}^{\begin{array}{c}km+\\ \lfloor \frac{j}{2}\rfloor -1\end{array}}\left(D_{2l+\tau \left(j\right)}\prod _{k_2=l+1}^{\begin{array}{c}km+\\ \lfloor \frac{j}{2}\rfloor -1\end{array}}{C}_{2k_2+\tau \left(j\right)}\right)}{\left(\prod _{k_1=0}^{\begin{array}{c}km+\\ \lfloor \frac{k+j}{2}\rfloor -1\end{array}}{A}_{2k_1+\tau (k+j)}\right)+u_{\tau (k+j)}{v}_{\tau (k+j)+(-k)}\sum _{l=0}^{\begin{array}{c}km+\\ \lfloor \frac{k+j}{2}\rfloor -1\end{array}}\left(B_{2l+\tau (k+j)}\prod _{k_2=l+1}^{\begin{array}{c}km+\\ \lfloor \frac{k+j}{2}\rfloor -1\end{array}}{A}_{2k_2+\tau (k+j)}\right)}\hfill \end{array}$$

(43)

and

$$\begin{array}{cc}\hfill & v_{2kn+j-k}=v_{j-k}\prod _{m=0}^{n-1}\frac{u_{\tau (k+j)-k}{v}_{\tau (k+j)}}{u_{\tau \left(j\right)}{v}_{\tau \left(j\right)-k}}\hfill \\ \hfill & \frac{\left(\prod _{k_1=0}^{\begin{array}{c}km+\\ \lfloor \frac{j}{2}\rfloor -1\end{array}}{A}_{2k_1+\tau \left(j\right)}\right)+u_{\tau \left(j\right)}{v}_{\tau \left(j\right)+(-k)}\sum _{l=0}^{\begin{array}{c}km+\\ \lfloor \frac{j}{2}\rfloor -1\end{array}}\left(B_{2l+\tau \left(j\right)}\prod _{k_2=l+1}^{\begin{array}{c}km+\\ \lfloor \frac{j}{2}\rfloor -1\end{array}}{A}_{2k_2+\tau \left(j\right)}\right)}{\left(\prod _{k_1=0}^{\begin{array}{c}km+\\ \lfloor \frac{k+j}{2}\rfloor -1\end{array}}{C}_{2k_1+\tau (k+j)}\right)+u_{\tau (k+j)+(-k)}{v}_{\tau (k+j)}\sum _{l=0}^{\begin{array}{c}km+\\ \lfloor \frac{k+j}{2}\rfloor -1\end{array}}\left(D_{2l+\tau (k+j)}\prod _{k_2=l+1}^{\begin{array}{c}km+\\ \lfloor \frac{k+j}{2}\rfloor -1\end{array}}{C}_{2k_2+\tau (k+j)}\right)},\hfill \end{array}$$

(44)

for $j=0$, 1, $2,$⋯, $2k-1$. Equations (43) and (44) are the solutions of (5).

3.1. The Case When $A_n$, $B_n$, $C_n$ and $D_n$ Are Constant Sequences

Letting $A_n=A,B_n=B,C_n=C\mathrm{and}{D}_n=D$ for all n simplifies (43) and (44) as follows:

$$\begin{array}{cc}\hfill & u_{2kn+j-k}=\hfill \\ & u_{j-k}\prod _{m=0}^{n-1}\frac{u_{\tau (k+j)}{v}_{\tau (k+j)-k}}{u_{\tau \left(j\right)-k}{v}_{\tau \left(j\right)}}\frac{C^{km+\lfloor \frac{j}{2}\rfloor }+D{u}_{\tau \left(j\right)+(-k)}{v}_{\tau \left(j\right)}\sum _{l=0}^{\begin{array}{c}km+\\ \lfloor \frac{j}{2}\rfloor -1\end{array}}{C}^l}{A^{km+\lfloor \frac{k+j}{2}\rfloor }+B{u}_{\tau (k+j)}{v}_{\tau (k+j)+(-k)}\sum _{l=0}^{\begin{array}{c}km+\\ \lfloor \frac{k+j}{2}\rfloor -1\end{array}}{A}^l}\hfill \end{array}$$

(45)

and

$$\begin{array}{cc}\hfill & v_{2kn+j-k}=\hfill \\ & v_{j-k}\prod _{m=0}^{n-1}\frac{u_{\tau (k+j)-k}{v}_{\tau (k+j)}}{u_{\tau \left(j\right)}{v}_{\tau \left(j\right)-k}}\frac{A^{km+\lfloor \frac{j}{2}\rfloor }+B{u}_{\tau \left(j\right)}{v}_{\tau \left(j\right)+(-k)}\sum _{l=0}^{km+\lfloor \frac{j}{2}\rfloor -1}{A}^l}{C^{km+\lfloor \frac{k+j}{2}\rfloor }+D{u}_{\tau (k+j)+(-k)}{v}_{\tau (k+j)}\sum _{l=0}^{\begin{array}{c}km+\\ \lfloor \frac{k+j}{2}\rfloor -1\end{array}}{C}^l},\hfill \end{array}$$

(46)

where $j=0,1,2,\cdots ,2k-1.$

3.2. A Detailed Study of the Case $k=2$

One of the aims of this section is to verify the results in [11,12]. To achieve this, we substitute $k=2$ into (45) and (46). It yields the following:

$$\begin{array}{c}\hfill u_{4n+j-2}=u_{j-2}\prod _{m=0}^{n-1}\frac{u_{\tau (2+j)}{v}_{\tau (2+j)-2}}{u_{\tau \left(j\right)-2}{v}_{\tau \left(j\right)}}\frac{C^{2m+\lfloor \frac{j}{2}\rfloor }+D{u}_{\tau \left(j\right)+(-2)}{v}_{\tau \left(j\right)}\sum _{l=0}^{\begin{array}{c}2m+\\ \lfloor \frac{j}{2}\rfloor -1\end{array}}{C}^l}{A^{2m+\lfloor \frac{2+j}{2}\rfloor }+B{u}_{\tau (2+j)}{v}_{\tau (2+j)-2}\sum _{l=0}^{\begin{array}{c}2m+\\ \lfloor \frac{2+j}{2}\rfloor -1\end{array}}{A}^l},\end{array}$$

(47)

and

$$\begin{array}{c}\hfill v_{4n+j-2}=v_{j-2}\prod _{m=0}^{n-1}\frac{u_{\tau (2+j)-2}{v}_{\tau (2+j)}}{u_{\tau \left(j\right)}{v}_{\tau \left(j\right)-2}}\frac{A^{2m+\lfloor \frac{j}{2}\rfloor }+B{u}_{\tau \left(j\right)}{v}_{\tau \left(j\right)+(-2)}\sum _{l=0}^{2m+\lfloor \frac{j}{2}\rfloor -1}{A}^l}{C^{2m+\lfloor \frac{2+j}{2}\rfloor }+D{u}_{\tau (2+j)+(-2)}{v}_{\tau (2+j)}\sum _{l=0}^{\begin{array}{c}2m+\\ \lfloor \frac{2+j}{2}\rfloor -1\end{array}}{C}^l},\end{array}$$

(48)

where $j=0,1,2,3.$ For the sake of clarity, we can rewrite (47) and (48) in expanded forms as follows:

$$\begin{array}{c}\hfill u_{4n-2}=u_{-2}\prod _{m=0}^{n-1}\frac{u_0{v}_{-2}}{u_{-2}{v}_0}\frac{C^{2m}+D{u}_{-2}{v}_0\sum _{l=0}^{2m-1}{C}^l}{A^{2m+1}+B{u}_0{v}_{-2}\sum _{l=0}^{2m}{A}^l},\end{array}$$

(49)

$$\begin{array}{c}\hfill u_{4n-1}=u_{-1}\prod _{m=0}^{n-1}\frac{u_1{v}_{-1}}{u_{-1}{v}_1}\frac{C^{2m}+D{u}_{-1}{v}_1\sum _{l=0}^{2m-1}{C}^l}{A^{2m+1}+B{u}_1{v}_{-1}\sum _{l=0}^{2m}{A}^l},\end{array}$$

(50)

$$\begin{array}{c}\hfill u_{4n}=u_0\prod _{m=0}^{n-1}\frac{u_0{v}_{-2}}{u_{-2}{v}_0}\frac{C^{2m+1}+D{u}_{-2}{v}_0\sum _{l=0}^{2m}{C}^l}{A^{2m+2}+B{u}_0{v}_{-2}\sum _{l=0}^{2m+1}{A}^l},\end{array}$$

(51)

$$\begin{array}{c}\hfill u_{4n+1}=u_1\prod _{m=0}^{n-1}\frac{u_1{v}_{-1}}{u_{-1}{v}_1}\frac{C^{2m+1}+D{u}_{-1}{v}_1\sum _{l=0}^{2m}{C}^l}{A^{2m+2}+B{u}_1{v}_{-1}\sum _{l=0}^{2m+1}{A}^l},\end{array}$$

(52)

$$\begin{array}{c}\hfill v_{4n-2}=v_{-2}\prod _{m=0}^{n-1}\frac{u_{-2}{v}_0}{u_0{v}_{-2}}\frac{A^{2m}+B{u}_0{v}_{-2}\sum _{l=0}^{2m-1}{A}^l}{C^{2m+1}+D{u}_{-2}{v}_0\sum _{l=0}^{2m}{C}^l},\end{array}$$

(53)

$$\begin{array}{c}\hfill v_{4n-1}=v_{-1}\prod _{m=0}^{n-1}\frac{u_{-1}{v}_1}{u_1{v}_{-1}}\frac{A^{2m}+B{u}_1{v}_{-1}\sum _{l=0}^{2m-1}{A}^l}{C^{2m+1}+D{u}_{-1}{v}_1\sum _{l=0}^{2m}{C}^l},\end{array}$$

(54)

$$\begin{array}{c}\hfill v_{4n}=v_0\prod _{m=0}^{n-1}\frac{u_{-2}{v}_0}{u_0{v}_{-2}}\frac{A^{2m+1}+B{u}_0{v}_{-2}\sum _{l=0}^{2m}{A}^l}{C^{2m+2}+D{u}_{-2}{v}_0\sum _{l=0}^{2m+1}{C}^l},\end{array}$$

(55)

$$\begin{array}{c}\hfill v_{4n+1}=v_1\prod _{m=0}^{n-1}\frac{u_{-1}{v}_1}{u_1{v}_{-1}}\frac{A^{2m+1}+B{u}_1{v}_{-1}\sum _{l=0}^{2m}{A}^l}{C^{2m+2}+D{u}_{-1}{v}_1\sum _{l=0}^{2m+1}{C}^l}.\end{array}$$

(56)

Theorem 1.

The following system of equations

$$\begin{array}{c}\hfill u_{n+1}=\frac{u_{n-1}{v}_{n-3}}{v_{n-1}(A+B{u}_{n-1}{v}_{n-3})}\mathrm{and}{v}_{n+1}=\frac{u_{n-3}{v}_{n-1}}{u_{n-1}(C+D{u}_{n-3}{v}_{n-1})},\end{array}$$

(57)

has a 2-periodic solution if $u_{-3}=u_{-1},v_{-3}=v_{-1}$, $u_{-3}{v}_{-3}=u_{-2}{v}_{-2}=\frac{(1-A)}{B}$ and $A=C$, $B=D\ne 0$.

Proof. 

Let $u_{-3}=u_{-1},v_{-3}=v_{-1}$ and $u_{-3}{v}_{-3}=u_{-2}{v}_{-2}=\frac{(1-A)}{B},\mathrm{where}A=C,B=D$ in the exact Equation (49). Then,

$$\begin{array}{cc}\hfill u_{4n-2}=& u_{-2}\prod _{m=0}^{n-1}\frac{C^{2m}+\left(1-C\right)\sum _{l=0}^{2m-1}{C}^l}{A^{2m+1}+\left(1-A\right)\sum _{l=0}^{2m}{A}^l}\hfill \\ \hfill =& u_{-2}.\hfill \end{array}$$

(58)

Following the same procedure as above on Equations ()–() gives $u_{4n-1}=u_{-1};$$u_{4n}=u_0;u_{4n+1}=u_1$ and $v_{4n-1}=v_{-1};v_{4n}=v_0;v_{4n+1}=v_1.$ □

Below is a graph that illustrates the theorem above. Figure 1 is when we let $A=C=2,B=D=-0.125,u_1=4,u_0=1,v_1=2$ and $v_0=8$ into the system of Equation (57).

If we let $A=B=C=1$ and $D=-1$, then Equations (49)–() reduce to Theorem 4 in [11] as shown below:

$$\begin{array}{cc}\hfill u_{4n-2}=& u_{-2}\prod _{m=0}^{n-1}\frac{u_0{v}_{-2}}{u_{-2}{v}_0}\frac{{\left(1\right)}^{2m}-u_{-2}{v}_0\sum _{i=1}^{2m}{\left(1\right)}^i}{{\left(1\right)}^{2m+1}+u_0{v}_{-2}\sum _{i=1}^{2m+1}{\left(1\right)}^i}\hfill \\ \hfill =& u_{-2}\prod _{m=0}^{n-1}\frac{u_0{v}_{-2}}{u_{-2}{v}_0}\frac{(-(\left(2m\right)u_{-2}{v}_0-1))}{1+(2m+1)u_0{v}_{-2}}\hfill \\ \hfill =& \frac{{(-1)}^n{\left(u_0\right)}^n{\left(v_{-2}\right)}^n\prod _{m=0}^{n-1}[\left(2m\right)u_{-2}{v}_0-1]}{{\left(u_{-2}\right)}^{n-1}{\left(v_0\right)}^n\prod _{m=0}^{n-1}[(2m+1)u_0{v}_{-2}+1]}.\hfill \end{array}$$

(59)

Just as above, we similarly obtain the following:

$$\begin{array}{c}\hfill u_{4n-1}=\frac{{(-1)}^n{\left(u_{-1}\right)}^{n+1}{\left(v_{-3}\right)}^n\prod _{m=0}^{n-1}[(2m+1)u_{-3}{v}_{-1}-1]}{{\left(u_{-3}\right)}^n{\left(v_{-1}\right)}^n\prod _{m=0}^{n-1}[(2m+2)u_{-1}{v}_{-3}+1]},\end{array}$$

(60)

$$\begin{array}{c}\hfill u_{4n}=\frac{{(-1)}^n{\left(u_0\right)}^{n+1}{\left(v_{-2}\right)}^n\prod _{m=0}^{n-1}[(2m+1)u_{-2}{v}_0-1]}{{\left(u_{-2}\right)}^n{\left(v_0\right)}^n\prod _{m=0}^{n-1}[(2m+2)u_0{v}_{-2}+1]},\end{array}$$

(61)

$$\begin{array}{c}\hfill u_{4n+1}=\frac{{(-1)}^n{\left(u_1\right)}^{n+1}{\left(v_{-1}\right)}^n\prod _{m=0}^{n-1}[(2m+1)u_{-1}{v}_1-1]}{{\left(u_{-1}\right)}^n{\left(v_1\right)}^n\prod _{m=0}^{n-1}[(2m+2)u_1{v}_{-1}+1]},\end{array}$$

(62)

$$\begin{array}{c}\hfill v_{4n-2}=\frac{{(-1)}^n{\left(u_{-2}\right)}^n{\left(v_0\right)}^n\prod _{m=0}^{n-1}[\left(2m\right)u_0{v}_{-2}+1]}{{\left(u_0\right)}^n{\left(v_{-2}\right)}^n\prod _{m=0}^{n-1}[(2m+1)u_{-2}{v}_0-1]},\end{array}$$

(63)

$$\begin{array}{c}\hfill v_{4n-1}=\frac{{(-1)}^n{\left(u_{-3}\right)}^n{\left(v_{-1}\right)}^{n+1}\prod _{m=0}^{n-1}[(2m+1)u_{-1}{v}_{-3}+1]}{{\left(u_{-1}\right)}^n{\left(v_{-3}\right)}^n\prod _{m=0}^{n-1}[(2m+2)u_{-3}{v}_{-1}-1]},\end{array}$$

(64)

$$\begin{array}{c}\hfill v_{4n}=\frac{{(-1)}^n{\left(u_{-2}\right)}^n{\left(v_0\right)}^{n+1}\prod _{m=0}^{n-1}[(2m+1)u_0{v}_{-2}+1]}{{\left(u_0\right)}^n{\left(v_{-2}\right)}^n\prod _{m=0}^{n-1}[(2m+2)u_{-2}{v}_0-1]},\end{array}$$

(65)

$$\begin{array}{c}\hfill v_{4n+1}=\frac{{(-1)}^n{\left(u_{-1}\right)}^n{\left(v_1\right)}^{n+1}\prod _{m=0}^{n-1}[(2m+1)u_1{v}_{-1}+1]}{{\left(u_1\right)}^n{\left(v_{-1}\right)}^n\prod _{m=0}^{n-1}[(2m+2)u_{-1}{v}_1-1]}.\end{array}$$

(66)

Similarly, if we let $A=B=C=D=1,$ then Equations (49)–() reduce to Theorem 1 in [11], as shown below:

$$\begin{array}{c}\hfill u_{4n-2}=u_{-2}\prod _{m=0}^{n-1}\frac{u_0{v}_{-2}}{u_{-2}{v}_0}\frac{{\left(1\right)}^{2m}+\left(1\right)u_{-2}{v}_0\sum _{i=1}^{2m}{\left(1\right)}^{i+1}}{{\left(1\right)}^{2m+1}+\left(1\right)u_0{v}_{-2}\sum _{i=1}^{2m+1}{\left(1\right)}^{i+1}}.\end{array}$$

(67)

In the above equation, we performed index shifting. Now,

$$\begin{array}{c}\hfill u_{4n-2}=u_{-2}\prod _{m=0}^{n-1}\frac{u_0{v}_{-2}}{u_{-2}{v}_0}\frac{1+\left(2m\right)u_{-2}{v}_0}{1+(2m+1)u_0{v}_{-2}}\end{array}$$

$$\begin{array}{c}\hfill =u_{-2}\prod _{m=0}^{n-1}\frac{u_0{v}_{-2}}{u_{-2}{v}_0}\frac{1+\left(2m\right)u_{-2}{v}_0}{1+(2m+1)u_0{v}_{-2}}.\end{array}$$

Thus, (49) simplifies to

$$\begin{array}{c}\hfill u_{4n-2}=\frac{{\left(u_0\right)}^n{\left(v_{-2}\right)}^n\prod _{m=0}^{n-1}[\left(2m\right)u_{-2}{v}_0+1]}{{\left(u_{-2}\right)}^{n-1}{\left(v_0\right)}^n\prod _{m=0}^{n-1}[(2m+1)u_0{v}_{-2}+1]}.\end{array}$$

(68)

Following the same procedure as above, Equations ()–(), respectively, result in the following equations:

$$\begin{array}{c}\hfill u_{4n-1}=\frac{{\left(u_{-1}\right)}^{n+1}{\left(v_{-3}\right)}^n\prod _{m=0}^{n-1}[(2m+1)u_{-3}{v}_{-1}+1]}{{\left(u_{-3}\right)}^n{\left(v_{-1}\right)}^n\prod _{m=0}^{n-1}[(2m+2)u_{-1}{v}_{-3}+1]},\end{array}$$

(69)

$$\begin{array}{c}\hfill u_{4n}=\frac{{\left(u_0\right)}^{n+1}{\left(v_{-2}\right)}^n\prod _{m=0}^{n-1}[(2m+1)u_{-2}{v}_0+1]}{{\left(u_{-2}\right)}^n{\left(v_0\right)}^n\prod _{m=0}^{n-1}[(2m+2)u_0{v}_{-2}+1]},\end{array}$$

(70)

$$\begin{array}{c}\hfill u_{4n+1}=\frac{{\left(u_{-1}\right)}^{n+1}{\left(v_{-3}\right)}^n\prod _{m=0}^{n-1}[(2m+1)u_{-3}{v}_{-1}+1]}{{\left(u_{-3}\right)}^n{\left(v_{-1}\right)}^n\prod _{m=0}^{n-1}[(2m+2)u_{-1}{v}_{-3}+1]},\end{array}$$

(71)

$$\begin{array}{c}\hfill v_{4n-2}=\frac{{\left(u_{-2}\right)}^n{\left(v_0\right)}^n\prod _{m=0}^{n-1}[\left(2m\right)u_0{v}_{-2}+1]}{{\left(u_0\right)}^{}{\left(v_{-2}\right)}^{n-1}\prod _{m=0}^{n-1}[(2m+1)u_{-2}{v}_0+1]},\end{array}$$

(72)

$$\begin{array}{c}\hfill v_{4n-1}=\frac{{\left(u_{-3}\right)}^n{\left(v_{-1}\right)}^{n+1}\prod _{m=0}^{n-1}[(2m+1)u_{-1}{v}_{-3}+1]}{{\left(u_{-1}\right)}^n{\left(v_{-3}\right)}^n\prod _{m=0}^{n-1}[(2m+2)u_{-3}{v}_{-1}+1]},\end{array}$$

(73)

$$\begin{array}{c}\hfill v_{4n}=\frac{{\left(u_{-2}\right)}^n{\left(v_0\right)}^{n+1}\prod _{m=0}^{n-1}[(2m+1)u_0{v}_{-2}+1]}{{\left(u_0\right)}^n{\left(v_{-2}\right)}^n\prod _{m=0}^{n-1}[(2m+2)u_{-2}{v}_0+1]},\end{array}$$

(74)

$$\begin{array}{c}\hfill v_{4n+1}=\frac{{\left(u_{-3}\right)}^n{\left(v_{-1}\right)}^{n+1}\prod _{m=0}^{n-1}[(2m+1)u_{-1}{v}_{-3}+1]}{{\left(u_{-1}\right)}^n{\left(v_{-3}\right)}^n\prod _{m=0}^{n-1}[(2m+2)u_{-3}{v}_{-1}+1]}.\end{array}$$

(75)

When $k=3$ in (5), the resulting O$\Delta$Es are

$$\begin{array}{c}\hfill u_{n+1}=\frac{u_{n-1}{v}_{n-4}}{v_{n-2}(a+b{u}_{n-1}{v}_{n-4})}\mathrm{and}{v}_{n+1}=\frac{u_{n-4}{v}_{n-1}}{u_{n-2}(c+d{u}_{n-4}{v}_{n-1})}.\end{array}$$

(76)

Example 1.

We get the illustration below (see Figure 2) when we let $a=c=-1$, $b=d=1,u_{-4}=7,u_{-3}=5,u_{-2}=-0.0971,u_{-1}=7,u_0=1,v_{-4}=3$, $v_{-3}=9,v_{-2}=0.01,v_{-1}=-3\mathrm{and}{v}_0=2$ in (76).

Example 2.

Letting $a=c=1,b=d=-1,u_{-4}=0.88,u_{-3}=0.35,u_{-2}=0.79,$$u_{-1}=0.95,u_0=0.31,v_{-4}=0.77,v_{-3}=0.33,v_{-2}=0.16,v_{-1}=0.35\mathrm{and}{v}_0=0.75$ in (76) yields Figure 3.

4. Conclusions

In this study, we looked at a system of $(k+2)$th order ordinary difference equations. We investigated these equations by finding the symmetry generators (29). We then used the canonical coordinates to find the invariants in (31) of which led us to get the closed form solutions (33) and (34). Performing iterations resulted in (36), where we used the floor function definition and back-shifted the resulting equations to obtain the solutions (43) and (44) of (5). We performed a detailed study of the case where $k=2$. The reason for studying this case is that we wanted to show that the work done in the articles [11,12] are special cases of our results. In fact, for different combinations of values of $A,B,C$ and D, which we get from the articles [11,12], we obtain the following important results:

Equations (49)–(56) are reduced to equations in Theorem 2 in [11] when we set $A=B=1\mathrm{and}C=D=-1.$

Equations (49)–(56) are reduced to equations in Theorem 3 in [11] when we set $A=B=D=1\mathrm{and}C=-1.$

Equations (49)–(56) are reduced to equations in Theorem 4 in [11] when we set $A=B=C=1\mathrm{and}D=-1.$

Equations (49)–(56) are reduced to equations in Theorem 1 in [12] when we set $A=C=1\mathrm{and}B=D=-1.$

Equations (49)–(56) are reduced to equations in Theorem 2 in [12] when we set $A=C=-1\mathrm{and}B=D=1.$

Equations (49)–(56) are reduced to equations in Theorem 3 in [12] when we set $A=D=1\mathrm{and}B=C=-1.$

Equations (49)–(56) are reduced to Theorem 4 in [12] when we set $A=D=-1$ and $B=C=1.$ We also stated and provided the proof for the existence of 2-periodic solutions.