`Journal of Applied MathematicsVolume 2011, Article ID 735825, 11 pageshttp://dx.doi.org/10.1155/2011/735825`
Research Article

## Periodicity in a Class of Systems of Delay Difference Equations

College of Mathematics and Econometrics, Hunan University, Changsha, Hunan 410082, China

Received 5 July 2011; Accepted 23 August 2011

Copyright © 2011 Zhijian Wei. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

We study a system of delay difference equations modeling four-dimensional discrete-time delayed neural networks with no internal decay. Such a discrete-time system can be regarded as the discrete analog of a differential equation with piecewise constant argument. By using semicycle analysis method, it is shown that every bounded solution of this discrete-time system is eventually periodic. The obtained results are new, and they complement previously known results.

#### 1. Introduction

Over the past decades, there has been increasing interest in the potential applications of the dynamics of artificial neural networks in signal and image processing. Among the most popular models in the literature of artificial neural networks is the following well-known Hopfield's model [1, 2]: where is the internal decay rate, is the delay incorporated by Marcus and Westervelt [3] to account for the finite switching speed of amplifiers (neurons), (the set of all real numbers) is the signal functions, and represents the connection strengths between neurons and if the output from neuron excites (resp., inhibits) neuron , then (resp., ), .

Much work on Hopfield-type neural networks with constant time delays has been carried out. However, from the point of view of electronic implementation of neural networks and control, the time-varying delay case is more suitable for practical neural networks, and we can achieve this by using piecewise constant arguments. Because of the wide application of differential equations with piecewise constant argument in certain biomedical models (see, e.g., [4]), much progress has been made in the study of differential equations with piecewise constant arguments since the pioneering work of Cooke and Wiener [5] and Shah and Wiener [6]. For more details and references on this subject, interested readers may refer to a survey of Cooke and Wiener [7]. Motivated by these discussions, we propose as a new neural network model, where denotes the greatest integer function and () are the McCulloch-Pitts nonlinear function given by Here, is referred as the threshold. The McCulloch-Pitts nonlinearity reflects the fact that the signal transmission is of digital nature: a neuron is either fully active or completely inactive.

Neural networks are complex and large-scale nonlinear dynamical systems, while the dynamics of the delayed neural networks is even richer and more complicated [8]. In order to obtain a deep and clear understanding of the dynamics of neural networks, the dynamics of delayed neural networks consisting of a few neurons has received increasing attention over the past years [914]. The studies on these neural networks of a few neurons are potentially useful because the complexities found in such models often provide promising information for the studies on more complicated neural networks with a large number of neurons [15]. So, we are inspired to consider a special case of (1.2), where is the activation function with McCulloch-Pitts nonlinearity (1.3), is a nonnegative integer and the negative (resp., positive) sign on the right indicates negative (resp., positive) feedback. (1.4) describes the dynamics of four interacting neurons with no internal decays.

To study (1.4), it is convenient to consider the following difference system: where is a nonnegative integer and satisfies (1.3). In fact, integrate (1.4) from to to get Letting , we get a special case of (1.5) with . Hence, system (1.5) can be regarded as a more general neural network model of four neurons with transmission delay.

Our study is inspired by the work of Chen [1618], who considered where is given by (1.3).

The main objective of this paper is to study (1.5) with satisfying (1.3). The discontinuity of makes it difficult to apply directly the theory of discrete dynamical systems to system (1.5). However, by using semicycle analysis method, we obtain some interesting results for the periodicity of (1.5). It is shown that every bounded solution of system (1.5) is eventually periodic.

The rest of the paper is organized as follows. In Section 2, we introduce some necessary notations and lemmas that will be used later. In Section 3, we state and prove our main result.

#### 2. Notations and Preliminaries

For the sake of simplicity, we introduce some notations. Let denote the set of all integers. For , , define and whenever .

By a solution of (1.5), we mean a sequence that satisfies (1.5). Clearly, for given , system (1.5) has a unique solution satisfying the initial condition: If all terms of the sequence are integers, we say that it is an integer sequence. If for all are integer sequences and also satisfy (1.5) and (1.3), then is said to be an integer sequence solution of (1.5) and (1.3).

Let be a solution of (1.5). Define Clearly, . From (1.5) and (1.3), we have , . Denote , . Then for all , . Moreover, if , then , and if , then , . Hence, is an integer sequence solution of (1.5) and (1.3) with .

So, without loss of generality, in the paper we always assume that , and a solution of (1.5) means an integer sequence solution.

A solution is said to be eventually periodic if there exist and such that for , and is called a period. The smallest such is called the minimal period of .

Definition 2.1. For a sequence , we say that with is a positive semicycle with the length if for , and and satisfy We call the length of the positive semicycle. A negative semicycle is defined similarly (replace > by ≤ and vice versa).
To simplify the following arguments, for an integer sequence, we denote the positive semicycle with for and the negative semicycle with for .

Definition 2.2. An integer sequence (may be infinite terms) is said to be an -normal cycle if it possesses one of the representations as follows: , , , and . In addition, if , then it is said to be a total -normal cycle.

Remark 2.3. For a -normal cycle , from Definition 2.2, it is easy to see that there must exist such that . If , that is, is a total -normal cycle, then .
Throughout this section, we tacitly assume that is a periodic solution of system (1.5) satisfying the initial values: In view of (1.5) and (1.3), it is easy to see that all terms , , , and of are integers, that is, is an integer sequence solution of (1.5).
For a periodic solution of (1.5), denote and let and be the length of the longest positive semicycle of and the length of the longest negative semicycle of , respectively, where . Note that for .
The following several lemmas will be useful to the proof of the main result in this paper.

Lemma 2.4. (a)Either or or for and .
(b)Either or or for and .

Proof. We only prove the conclusion: either or or . The other conclusions can be proved similarly. Now, we distinguish two cases to finish the proof.
Case 1. for some . Without loss of generality, we assume that . Then, from (1.5) and (1.3), we have
(i)If , it follows from (2.7) that . Since the distance between consecutive elements of is 1, we have .
(ii)If , it follows from (2.8) that . Thus, .

Case 2. for some . Without loss of generality, we assume that , and . Then, from (1.5) and (1.3), we have (i)If , it follows from (2.9) that . Thus, .(ii)If , it follows from (2.10) that . Thus, .(iii)If , it follows from (2.9) and (2.10) that and . Thus, .
Therefore, we have either or or . This completes the proof.

Lemma 2.5. for . Moreover, is odd.

Proof. The lemma follows immediately from Lemma 2.4 together with its proof.

Lemma 2.6. for .

Proof. First, we claim that . Otherwise, . Since the distance between consecutive elements of is 1, it follows easily from the definitions of and that . By Lemma 2.5, there exists such that , which implies that . Without loss of generality, we assume that , and . Note that and . It follows from (2.9) and the definition of that Thus, , which, together with (2.10), implies that It follows that and hence, , a contradiction to Lemma 2.5. This proves the claim. Repeating the same argument as that in the proof of the above claim, we have , , and for and . Thus, we get for . This completes the proof.

Lemma 2.7. .

Proof. It follows from the definitions of and that . We show by way of contradiction. Assume that . By Lemma 2.5, there exists such that , which implies that . Without loss of generality, we assume that , and . Now, we distinguish two cases to finish the proof.
Case 1. . For this case, from (1.5) and (1.3), we have which implies that , a contradiction to Lemma 2.6.
Case 2. . For this case, from (1.5) and (1.3), we have which implies that , a contradiction to Lemma 2.6. This completes the proof.

Throughout the remaining part of this paper, we denote .

Lemma 2.8. (a) for some . Moreover, and .
(b) for some . Moreover, and .
(c) for some . Moreover, and .
(d) for some . Moreover, and .

Proof. We only give the proof of the conclusion (c). The other conclusions can be proved similarly. By the definition of , there must exist such that . Since the distance between consecutive elements of is 1, it follows that for all . We claim that . Otherwise, or . If , it follows from (1.5) and (1.3) that Thus, , which implies that , a contradiction to Lemma 2.6. If , it follows from (1.5) and (1.3) that Thus, , which implies that , a contradiction to Lemma 2.6. This proves the claim. By (1.5) and (1.3), we must have This completes the proof.

Arguing as in the proof of Lemma 2.8, we can get the following result.

Lemma 2.9. (a) for some . Moreover, and .
(b) for some . Moreover, and .
(c) for some . Moreover, and .
(d) for some . Moreover, and .

Lemma 2.10. .

Proof. Without loss of generality, we assume that , , and . It follows from Lemma 2.8 that . By (1.5) and (1.3), we have Thus, . It follows from Lemma 2.8 that , and hence, by Lemma 2.9, we have . From (1.5) and (1.3), we get Thus, . Therefore, by Lemma 2.8, we have . Since , it follows that , and hence . This completes the proof.

We hereafter use to denote the length of the longest normal cycle of , where .

Lemma 2.11. , .

Proof. We show that for by way of contradiction. Without loss of generality, we assume that . We will distinguish several cases to finish the proof.
Case 1. , . Without loss of generality, we assume that is a total normal cycle and . Then, for , and for . By Lemmas 2.8 and 2.9, we have for . Therefore, is a total normal cycle, which is a contradiction to .
Case 2. , . Without loss of generality, we assume that . Then, by the definition of , there exists such that is the length of the longest normal cycle of . Without loss of generality, we assume that is a normal cycle and . To finish the proof of Case 2, we will distinguish two subcases.
Subcase 1. . Then there exists such that . Thus, By Lemmas 2.8 and 2.9, we have for and for . It follows from that . This, combined with gives . By Lemma 2.10, we have . Therefore, the total number of and contained in is . Since it follows that is a normal cycle with the length of , and hence , which leads to a contradiction.
Subcase 2. . Then, using a similar argument to that in the proof of Subcase 1, we can show that this is also a contradiction.
If , , or , , , then we have the same contradiction by similar arguments. This completes the proof.

#### 3. Main Result and Proof

Theorem 3.1. For , every bounded solution of (1.5) is eventually periodic with the minimal period for some , where .

Proof. Let be a bounded solution of (1.5). Then there exists a positive integer such that for all . Denote for and , and Define by setting for and , and define as Then, . Since for all and for all and , it follows that is a finite set. Therefore, there exist such that . This, combined with , gives for . Hence, is eventually periodic with the period . It follows that are also eventually periodic, . Therefore, is eventually periodic with the minimal period . By Lemma 2.11, there exists some such that . Without loss of generality, we assume that is a total -normal cycle, and . Then, . By Lemma 2.8, we can get that and . It follows from Lemma 2.9 that and , and so, again by Lemma 2.8, and . By Lemma 2.8, we have and . From (1.5) and (1.3), we can get . Thus, . Therefore, consists of , consecutively, in total of semicycles, in which is a positive even integer. Consequently, there exists an integer such that , that is, , which implies that . This completes the proof.

#### Acknowledgment

This paper is supported by the Fundamental Research Funds for the Central Universities of Hunan University (Grant no. 531107040013).

#### References

1. J. J. Hopfield, “Neural networks and physical systems with emergent collective computational abilities,” Proceedings of the National Academy of Sciences of the United States of America, vol. 79, no. 8, pp. 2554–2558, 1982.
2. J. J. Hopfield, “Neurons with graded response have collective computational properties like those of two-state neurons,” Proceedings of the National Academy of Sciences, vol. 81, pp. 3088–3092, 1984.
3. C. M. Marcus and R. M. Westervelt, “Stability of analog neural networks with delay,” Physical Review A, vol. 39, no. 1, pp. 347–359, 1989.
4. S. Busenberg and K. L. Cooke, “Models of vertically transmitted diseases with sequential-continuous dynamics,” in Nonlinear Phenomena in Mathematical Science, V. Lakshmikanthan, Ed., pp. 179–187, Academic Press, New York, NY, USA, 1982.
5. K. L. Cooke and J. Wiener, “Retarded differential equations with piecewise constant delays,” Journal of Mathematical Analysis and Applications, vol. 99, no. 1, pp. 265–297, 1984.
6. S. M. Shah and J. Wiener, “Advanced differential equations with piecewise constant argument deviations,” International Journal of Mathematics and Mathematical Sciences, vol. 6, no. 4, pp. 671–703, 1983.
7. K. L. Cooke and J. Wiener, “A survey of differential equations with piecewise continuous arguments,” in Delay Differential Equations and Dynamical systems, vol. 1475 of Lecture Notes in Mathematics, pp. 1–15, Springer, Berlin, Germany, 1991.
8. J. Wu, Introduction to Neural Dynamics and Signal Transmission Delay, vol. 6 of de Gruyter Series in Nonlinear Analysis and Applications, Walter de Gruyter, Berlin, Germany, 2001.
9. H. Bin, L. Huang, and G. Zhang, “Convergence and periodicity of solutions for a class of difference systems,” Advances in Difference Equations, vol. 2006, Article ID 70461, 10 pages, 2006.
10. S. J. Guo, L. Huang, and J. Wu, “Regular dynamics in a delayed network of two neurons with all-or-none activation functions,” Physica D, vol. 206, no. 1-2, pp. 32–48, 2005.
11. X. C. Mao and H. Y. Hu, “Hopf bifurcation analysis of a four-neuron network with multiple time delays,” Nonlinear Dynamics, vol. 55, no. 1-2, pp. 95–112, 2009.
12. J. Milton, Dynamics of Small Neural Populations, vol. 7 of CRM Monograph Series, American Mathematical Society, Providence, RI, USA, 1996.
13. Z. Wei, L. Huang, and Y. Meng, “Unboundedness and periodicity of solutions for a discrete-time network model of three neurons,” Applied Mathematical Modelling. Simulation and Computation for Engineering and Environmental Systems, vol. 32, no. 7, pp. 1463–1474, 2008.
14. Z. Zhou and J. Wu, “Attractive periodic orbits in nonlinear discrete-time neural networks with delayed feedback,” Journal of Difference Equations and Applications, vol. 8, no. 5, pp. 467–483, 2002.
15. J. Wei and S. Ruan, “Stability and bifurcation in a neural network model with two delays,” Physica D, vol. 130, no. 3-4, pp. 255–272, 1999.
16. Y. Chen, “All solutions of a class of difference equations are truncated periodic,” Applied Mathematics Letters, vol. 15, no. 8, pp. 975–979, 2002.
17. Y. M. Chen, “Limiting behavior of a class of delay difference equations,” Dynamics of Continuous, Discrete and Impulsive Systems: Series A, vol. 10, no. 1–3, pp. 75–80, 2003.
18. Y. M. Chen, “Unboundedness and periodicity of a system of delay difference equations,” Mitteilungen aus dem Mathematischen Seminar Giessen, no. 248, pp. 1–19, 2002.