(ProQuest: ... denotes non-US-ASCII text omitted.)
Stevo Stevic 1 and Josef Diblík 2, 3 and Bratislav Iricanin 4 and Zdenek Smarda 3
Recommended by Svatoslav Stanek
1, Mathematical Institute of the Serbian Academy of Sciences and Arts, Knez Mihailova 36/III, 11000 Beograd, Serbia
2, Department of Mathematics and Descriptive Geometry, Faculty of Civil Engineering, Brno University of Technology, 60200 Brno, Czech Republic
3, Department of Mathematics, Faculty of Electrical Engineering and Communication, Brno University of Technology, 61600 Brno, Czech Republic
4, Faculty of Electrical Engineering, University of Belgrade, Bulevar Kralja Aleksandra 73, 11000 Beograd, Serbia
Received 8 August 2012; Accepted 27 September 2012
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.
1. Introduction
Recently, there has been a great interest in difference equations and systems (see, e.g., [ 1- 25]), and among them in those ones which can be solved explicitly (see, e.g., [ 1- 5, 9- 11, 15, 16, 18- 24] and the related references therein). For some classical results in the topic see, for example, [ 7].
Beside the above-mentioned papers, there are some papers which give formulae of some very particular equations and systems which are proved by induction, but without any explanation how these formulae are obtained and how these authors came across the equations and systems. Our explanation of such a formula that we gave in [ 10] has re-attracted attention to solvable difference equations.
Our aim here is to give theoretical explanations for some of the formulae recently appearing in the literature, as well as to give some extensions of their equations.
Before we formulate our results, we would like to say that the system of difference equations [figure omitted; refer to PDF] where a ,b ,c , α , β , and γ are real numbers, was completely solved in [ 15], that is, we found formulae for all well-defined solutions of system ( 1.1).
2. Scaling Indices
In the recent paper [ 25] were given some formulae for the solutions of the following systems of difference equations: [figure omitted; refer to PDF]
Now we show that the results regarding system ( 2.1) easily follow from known ones. Indeed, if we use the change of variables [figure omitted; refer to PDF] then the systems in ( 2.1) are reduced to the next systems [figure omitted; refer to PDF] This means that ( u n (i ) , v n (i ) ) n ...5; -2 , i =1,2 , are two (independent) solutions of the systems of difference equations [figure omitted; refer to PDF] However, all the systems of difference equations in ( 2.4) are particular cases of system ( 1.1). Hence, formulae for the solutions of systems ( 2.1) given in [ 25] follow directly from those in [ 15].
2.1. An Extension of Systems ( 2.1)
Systems ( 2.1) can be extended as follows: [figure omitted; refer to PDF] where k is a fixed natural number.
If we use the change of variables [figure omitted; refer to PDF] then system ( 2.5) is reduced to the following k systems of difference equations: [figure omitted; refer to PDF] i =1 , ... ,k . This means that ( u n (i ) , v n (i ) ) n ...5; -2 , i =1 , ... ,k , are k (independent) solutions of system ( 1.1), and solutions of system ( 2.5) are obtained by interlacing solutions of systems ( 2.7), i =1 , ... ,k .
For example, a natural extension of the systems in ( 2.1) is obtained for taking k =3 , b /a = ±1 , c /a = ±1 , β / α = ±1 , and γ / α = ±1 in ( 2.5), that is, the system becomes [figure omitted; refer to PDF]
In this way it can be obtained countable many, at first sight different, systems of difference equations. Systems of difference equations in ( 2.1) are artificially obtained in this way. This method can be applied to any equation or system of difference equations, and one can get papers with putative "new" results.
3. Some Third-Order Systems of Difference Equations Related to ( 1.1)
The following third-order systems of difference equations [figure omitted; refer to PDF] n ∈ ... 0 , have been studied recently (see [ 6] and the references therein).
As is directly seen, the first two equations in systems ( 3.1)-( 3.3) are the same, and they form a particular case of system ( 1.1) which is solved in [ 15].
Since we know solutions for x n and y n , it is only needed to find explicit solutions for z n in the third equations in systems ( 3.1)-( 3.3), that is, in all three equations, the only unknown sequence is z n . The joint feature for all three cases is that z n can be solved in closed form.
Now we discuss systems of difference equations given in ( 3.1)-( 3.3).
Case of System ( 3.1)
From the third equation in ( 3.1), we get [figure omitted; refer to PDF] from which it follows that [figure omitted; refer to PDF]
Case of System ( 3.3)
From the third equation in ( 3.3), we get [figure omitted; refer to PDF] from which it follows that [figure omitted; refer to PDF]
Remark 3.1.
The third equations in systems ( 3.1) and ( 3.3) are particular cases of the following difference equation (up to the shifting indices): [figure omitted; refer to PDF] where k ∈ ... . From ( 3.8), it follows that [figure omitted; refer to PDF] and consequently, [figure omitted; refer to PDF]
Case of System ( 3.2)
If we use the change of variables v n =1 / z n , the third equation in ( 3.2) becomes [figure omitted; refer to PDF] Hence, [figure omitted; refer to PDF] from which it follows that [figure omitted; refer to PDF] so that [figure omitted; refer to PDF]
Remark 3.2.
The third equation in system ( 3.2) is a particular case of the following difference equation: [figure omitted; refer to PDF] which, by the change of variables z n =1 / v n , is transformed into [figure omitted; refer to PDF] from which it follows that [figure omitted; refer to PDF] so by a well-known formula, we have that [figure omitted; refer to PDF] for m ∈ ... 0 and i =0,1 , ... ,k -1 , and consequently, [figure omitted; refer to PDF] for m ∈ ... 0 and i =0,1 , ... ,k -1 .
Remark 3.3.
Note that ( 3.16) suggests that the third equation in ( 3.2) can be also of the form [figure omitted; refer to PDF] where k ∈ ... is fixed, that is, to be an equation which consists of k (independent) linear first-order difference equation, which is solvable. In fact, the third equation in systems ( 3.1)-( 3.3) can be any difference equation which can be solved in z n , and in this way we can obtain numerous putative "new" results.
4. A Generalization of System ( 1.1)
Consider the following system of difference equations: [figure omitted; refer to PDF] where g ,h : ... [arrow right] ... are increasing functions such that [figure omitted; refer to PDF]
Now we will find formulae for all well-defined solutions of system ( 4.1), that is, for the solutions ( x n , y n ) , n ...5; -1 , such that [figure omitted; refer to PDF] for every n ∈ ... 0 .
If x -1 =0 , then from ( 4.1), ( 4.2), and ( 4.3), and by the method of induction, we get x 2n +1 =0 , n ∈ ... 0 . Also, if x 0 =0 , then from ( 4.1), ( 4.2), and ( 4.3), and by the method of induction, we get x 2n =0 , n ∈ ... 0 . Similarly, if y -1 =0 , then we get y 2n +1 =0 , n ∈ ... 0 , while if y 0 =0 , then we get y 2n =0 , n ∈ ... 0 .
If x n 0 =0 for some n 0 ∈ ... , then from ( 4.1)-( 4.3) it follows that x n 0 -2k =0 , for each k ∈ ... 0 such that n 0 -2k ...5; -1 . Hence, in this case we have that x -1 =0 or x 0 =0 . Similarly, if y n 1 =0 for some n 1 ∈ ... , then from ( 4.1)-( 4.3) it follows that y n 1 -2k =0 , for each k ∈ ... 0 such that n 1 -2k ...5; -1 . Hence, in this case we have that y -1 =0 or y 0 =0 . Thus, in both cases we arrive at a situation explained in the previous paragraph.
Hence, from now on, we assume that none of the initial values x -1 , x 0 , y -1 , and y 0 is equal to zero. Then, for every well-defined solution of system ( 4.1), we have that x n ...0;0 and y n ...0;0 , for every n ...5; -1 , and consequently g ( x n ) ...0;0 and h ( y n ) ...0;0 , for every n ...5; -1 .
Let [figure omitted; refer to PDF] then by taking function g to the first equation in system ( 4.1) and function h to the second one, then multiplying the first equation in such obtained system by h ( y n ) and the second by g ( x n ) , system ( 4.1) is transformed into: [figure omitted; refer to PDF] from which it follows that [figure omitted; refer to PDF]
Hence, if bd ...0;1 , we have that [figure omitted; refer to PDF] while if bd =1 , we have that [figure omitted; refer to PDF]
We have also that [figure omitted; refer to PDF] while if bd =1 , we have that [figure omitted; refer to PDF]
From ( 4.5), we have that [figure omitted; refer to PDF]
Using the relations ( 4.12), we get [figure omitted; refer to PDF]
Example 4.1.
If we choose g (t ) = t 2k +1 and h (t ) = t 2l +1 for some k ,l ∈ ... 0 , then conditions ( 4.2) and ( 4.3) are obviously satisfied, and system ( 4.1) can be written in the form [figure omitted; refer to PDF] and from ( 4.13), we have that its solutions are given by [figure omitted; refer to PDF]
Remark 4.2.
System ( 4.1) can be generalized by using the method of scaling indices from Section 2.1, that is, the following system is also solvable: [figure omitted; refer to PDF] n ∈ ... 0 , where k ∈ ... and g ,h : ... [arrow right] ... are increasing functions satisfying conditions ( 4.2) and ( 4.3).
It is easy to see that the change of variables in ( 2.6) leads to the following k systems of difference equations: [figure omitted; refer to PDF] for i =1 , ... ,k .
Remark 4.3.
Well-defined solutions of the following system of difference equations: [figure omitted; refer to PDF] where g ,h : ... [arrow right] ... are increasing functions satisfying conditions ( 4.2) and ( 4.3) and a n , b n , c n , and d n , n ∈ ... 0 , are real sequences, can be found similarly. We omit the details.
5. Solutions of a Generalization of a Recent Equation
Explaining some recent formulae appearing in the literature, in our recent paper [ 24], we have found formulae for well-defined solutions of the following difference equation: [figure omitted; refer to PDF] where k ∈ ... and the parameters a , b as well as initial values x -i , i = 0 ,k ¯ are real numbers.
Equation ( 5.1) can be extended naturally in the following way: [figure omitted; refer to PDF] where k ∈ ... and the sequences ( a n ) n ∈ ... 0 , ( b n ) n ∈ ... 0 , as well as initial values x -i , i = 0 ,k ¯ , are real numbers.
Employing the change of variables [figure omitted; refer to PDF] Equation ( 5.2) is transformed into the linear first-order difference equation [figure omitted; refer to PDF] whose general solution is [figure omitted; refer to PDF]
From ( 5.3), we have that [figure omitted; refer to PDF] for n ...5;k , which yields [figure omitted; refer to PDF] for every m ∈ ... 0 and i ∈ {k ,k +1 , ... ,3k -1 } .
Using ( 5.5) in ( 5.7), we get [figure omitted; refer to PDF] for every m ∈ ... 0 and i ∈ {k ,k +1 , ... ,3k -1 } .
Formula ( 5.8) generalizes the main formulae obtained in our paper [ 24].
Acknowledgments
The second author is supported by the Grant P201/10/1032 of the Czech Grant Agency (Prague) and the "Operational Programme Research and Development for Innovations," no. CZ.1.05/2.1.00/03.0097, as an activity of the regional Centre AdMaS. The fourth author is supported by the Grant FEKT-S-11-2-921 of Faculty of Electrical Engineering and Communication, Brno University of Technology and by the Grant P201/11/0768 of the Czech Grant Agency (Prague). This paper is also supported by the Serbian Ministry of Science projects III 41025, III 44006, and OI 171007.
[1] A. Andruch-Sobilo, M. Migda, "On the rational recursive sequence x n +1 = αxn -1 / ( b +c x n -1 ) ,", vol. 43, pp. 1-9, 2009.
[2] I. Bajo, E. Liz, "Global behaviour of a second-order nonlinear difference equation," Journal of Difference Equations and Applications , vol. 17, no. 10, pp. 1471-1486, 2011.
[3] L. Berg, S. Stevic, "On difference equations with powers as solutions and their connection with invariant curves," Applied Mathematics and Computation , vol. 217, no. 17, pp. 7191-7196, 2011.
[4] L. Berg, S. Stevic, "On some systems of difference equations," Applied Mathematics and Computation , vol. 218, no. 5, pp. 1713-1718, 2011.
[5] B. Iricanin, S. Stevic, "On some rational difference equations," Ars Combinatoria , vol. 92, pp. 67-72, 2009.
[6] A. S. Kurbanli, "On the behavior of solutions of the system of rational difference equations x n +1 = x n -1 / yn x n -1 -1 ) , y n +1 = y n -1 / ( xn y n -1 -1 ) and z n +1 = z n -1 / ( yn z n -1 -1 ) ," Advances in Difference Equations , vol. 2011, 2011.
[7] H. Levy, F. Lessman Finite Difference Equations , pp. vii+278, The Macmillan Company, New York, NY, USA, 1961.
[8] G. Papaschinopoulos, C. J. Schinas, G. Stefanidou, "On the nonautonomous difference equation x n +1 = An + ( x n -1 p / xnq ) ," Applied Mathematics and Computation , vol. 217, no. 12, pp. 5573-5580, 2011.
[9] G. Papaschinopoulos, G. Stefanidou, "Asymptotic behavior of the solutions of a class of rational difference equations," International Journal of Difference Equations , vol. 5, no. 2, pp. 233-249, 2010.
[10] S. Stevic, "More on a rational recurrence relation," Applied Mathematics E-Notes , vol. 4, pp. 80-85, 2004.
[11] S. Stevic, "A short proof of the Cushing-Henson conjecture," Discrete Dynamics in Nature and Society , vol. 2006, 2006.
[12] S. Stevic, "On the recursive sequence x n +1 =max { c , xnp / x n -1 p } ," Applied Mathematics Letters , vol. 21, no. 8, pp. 791-796, 2008.
[13] S. Stevic, "Global stability of a max-type difference equation," Applied Mathematics and Computation , vol. 216, no. 1, pp. 354-356, 2010.
[14] S. Stevic, "On a nonlinear generalized max-type difference equation," Journal of Mathematical Analysis and Applications , vol. 376, no. 1, pp. 317-328, 2011.
[15] S. Stevic, "On a system of difference equations," Applied Mathematics and Computation , vol. 218, no. 7, pp. 3372-3378, 2011.
[16] S. Stevic, "On the difference equation xn = x n -2 / ( bn + cn x n -1 x n -2 ) ," Applied Mathematics and Computation , vol. 218, no. 8, pp. 4507-4513, 2011.
[17] S. Stevic, "Periodicity of a class of nonautonomous max-type difference equations," Applied Mathematics and Computation , vol. 217, no. 23, pp. 9562-9566, 2011.
[18] S. Stevic, "On a system of difference equations with period two coefficients," Applied Mathematics and Computation , vol. 218, no. 8, pp. 4317-4324, 2011.
[19] S. Stevic, "On a third-order system of difference equations," Applied Mathematics and Computation , vol. 218, no. 14, pp. 7649-7654, 2012.
[20] S. Stevic, "On some solvable systems of difference equations," Applied Mathematics and Computation , vol. 218, no. 9, pp. 5010-5018, 2012.
[21] S. Stevic, "On the difference equation xn = x n -k / (b +c x n -1 ... x n -k ) ,", vol. 218, no. 11, pp. 6291-6296, 2012.
[22] S. Stevic, J. Diblík, B. Iricanin, Z. Smarda, "On a third-order system of difference equations with variable coefficients," Abstract and Applied Analysis , vol. 2012, 2012.
[23] S. Stevic, J. Diblík, B. Iricanin, Z. Smarda, "On the difference equation xn = an x n -k / ( bn + cn x n -1 x n -k ) ," Abstract and Applied Analysis , vol. 2012, 2012.
[24] S. Stevic, J. Diblík, B. Iricanin, Z. Smarda, "On the difference equation x n +1 = xn x n -k / ( x n -k +1 ( a +b xn x n -k ) ) ," Abstract and Applied Analysis , vol. 2012, 2012.
[25] N. Touafek, E. M. Elsayed, "On the solutions of systems of rational difference equations," Mathematical and Computer Modelling , vol. 55, no. 7-8, pp. 1987-1997, 2012.
[]
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
Copyright © 2012 Stevo Stevic et al. Stevo Stevic et al. 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
Here, we give explicit formulae for solutions of some systems of difference equations, which extend some very particular recent results in the literature and give natural explanations for them, which were omitted in the previous literature.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer