![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
Abstract
We investigate the solutions to the following system of nonlinear difference equations, , where
,
,
, and
are constants and
.
Public Interest Statement
Difference equations are pervasive in mathematics and recent advances give insight into other fields such as biology and engineering as well. Understanding the analysis of such equations is crucial in many applications in today’s society. In particular, many equations are discrete in nature and need a solid understanding of the theory of difference equations. We develop conditions for which a system of difference equations will be periodic, oscillatory, or nonperiodic. Also, the general solutions of such systems are given.
1. Introduction
Many authors have studied the solutions of max-type difference equations (see El-Dessoky, MR3400335; Elsayed, Iricanin, & Stevic, elsayed2010max; Kent, Kustesky, Nguyen, & Nguyen, kent2003eventually; Kent & Radin, kent2003boundedness; Stević, MR2577582, MR3037547; Yalçinkaya, Iricanin, & Cinar, yalccinkaya2008max).
Next are a few papers on systems of max-type difference equations:
Stević, Alghamdi, Alotaibi, and Naseer Shahzad (MR3262799) studied the boundedness characteristic of the following max-type difference equations
Stević (MR2916163) studied the solutions to the following max-type difference equation
We shall study the solutions to the following system of nonlinear difference equations,(1.1)
(1.1)
where ,
,
, and
are constants and
.
2. Main results
Lemma 2.1
Assume that . Then
the following equalities hold:
Proof
Show that
We shall proceed by induction on n. Let , then
and
Therefore,
So the result holds for
. For
Now suppose for some
, we have
and
Show that
Observe,
and
Hence,
Therefore, the result is true Similarly, the remaining equalities hold.
Theorem 2.1
Assume that . Also, let
be a solution of the system of Equation (1.1) with
,
,
, and
. Then all solutions of (1.1) are of the following:
Proof
For , we have
So the result holds for . Now suppose the result is true for some
, that is,
Also, for we have the following:
Therefore the result is true for every . This concludes the proof.
Lemma 2.2
Assume that and
. Then
the following equalities hold:
Proof
Show that
We shall proceed by induction on n. Let , then
and
Therefore,
So the result holds for
. For
Now suppose for some
, we have
and
Show that
Observe,
and
Hence,
Therefore, the result is true Similarly, the remaining equalities hold.
Theorem 2.2
Assume that and
. Also, let
be a solution of the system of Equations (1.1) with
,
,
, and
. Then all solutions of (1.1) are of the following:
Proof
For , we have
So the result holds for . Now suppose the result is true for some
, that is,
Also, for we have the following:
Therefore the result is true for every . This concludes the proof.
Theorem 1.3 Let be a solution of the system of Equations (1.1) with
, and
. Assume that
and
where
Then all solutions of (1.1) are periodic with period 4 and given by the following:
Proof For
, we have
So the result holds for . Now suppose the result is true for some
, that is,
Also, for we have the following:
Therefore the result is true for every . This concludes the proof.
To see the periodic behavior of , observe the following three diagrams with
,
,
,
and
:
Lemma 1.3 Assume that and
. Then
the following equalities hold:
Proof First, note that
this implies that
. Multiplying by A and using the assumption
means that
. So, for
we have
and
Therefore,
So the result holds for
. Now suppose for some
, we have
and
this means that Show that
Observe,
and
Hence,
Therefore, the result is true Similarly, the remaining equalities hold.
Theorem 1.4 Assume that and
. Also, let
be a solution of the system of Equations (1.1) with
,
,
, and
. Then all solutions of (1.1) are of the following:
For ,
Proof First,
Since, . Next, we shall proceed by induction on n. For
, we have
So the result holds for . Now suppose the result is true for some
, that is:
Also, for we have the following:
Therefore the result is true for every . This concludes the proof.
Theorem 1.5 Let be a solution of the system of Equations (1.1) with
and
. Assume that
and
where
Then all solutions of (1.1) are periodic with period 4 and given by the following:
For ,
Proof The result follows by the principle of mathematical induction.
To see the periodic behavior of , observe the following three diagrams with
,
,
,
, and
:
Correction
This article was originally published with errors. This version has been amended to remove erroneous text after the first equation on page two of the article.
Additional information
Funding
Notes on contributors
J.L. Williams
J.L. Williams received his PhD in mathematics from Mississippi State University (MSU) August 2013 and his master’s in mathematical sciences from MSU May 2008. In particular, his research area is in partial differential equations (PDE). In PDE, he mainly studies the existence and nonexistence to elliptic equations. He is the first African-American to receive a PhD in Mathematics from MSU.
Williams received his bachelor’s degree in mathematics with a minor in Business from the University of Mississippi (Olemiss) in 2006, where he was a member of Pi Mu Epsilon (Honorary math society). Williams is an assistant professor of mathematics at Texas Southern University (TSU), where he started in fall 2013. He has published several papers in professional journals since being at TSU. Also, he received the College of Science, Engineering, & Technology Distinguished Teaching Award and the McCleary Teaching Excellent Award at the university level for teaching.
References
- El-Dessoky, M. M. (2015). On the periodicity of solutions of max-type difference equation. Mathematical Methods in the Applied Sciences, 38, 3295–3307.
- Elsayed, E. M., Iricanin, B., & Stevic, S. (2010). On the max-type equation xn+ 1= max { An/xn, xn-1 }. Ars Combinatoria, 95, 187–192.
- Kent, C. M., Kustesky, M., Nguyen, A. Q., & Nguyen, B. V. (2003). Eventually periodic solutions of xn+ 1= max { (An)(Xn’)(Bn)(xn-1) } when the parameters are two cycles. Dynamics Of Continuous Discrete And Impulsive Systems-Series A-Mathematical Analysis, 10, 33–49.
- Kent, C. M., & Radin, M. A. (2003). On the boundedness nature of positive solutions of the difference equation x (n+ 1)= max (a (n)/x (n), bn/x (n-1)) with periodic parameters. Dynamics Of Continuous Discrete And Impulsive Systems-Series B-Applications & Algorithms, 11–15.
- Stević, S. (2010). On a generalized max-type difference equation from automatic control theory. Nonlinear Analysis, 72, 1841–1849.
- Stević, S. (2012). Solutions of a max-type system of difference equations. Applied Mathematics and Computation, 218, 9825–9830.
- Stević, S. (2013). On a symmetric system of max-type difference equations. Applied Mathematics and Computation, 219, 8407–8412.
- Stević, S., Alghamdi, M. A., Alotaibi, A., & Shahzad, N. (2014). Boundedness character of a max-type system of difference equations of second order. Electronic Journal of Qualitative Theory of Differential Equations, 12, 45 pages.
- Yalçinkaya, I., Iricanin, B. D., & Cinar, C. (2008). On a max-type difference equation. Discrete Dynamics in Nature and Society, 2007, 10 pages.