On the Periodic Nature of Solutions to the Reciprocal Difference Equation with Maximum
No Thumbnail Available
Files
Date
2005-04-05
Authors
Journal Title
Series/Report No.
Journal ISSN
Volume Title
Publisher
Abstract
We prove that every positive solution of the difference equation
x[subscript n] = max[A[subscript i] ⁄ x[subscript n-i] | i ∈ [1,k]]
is eventually periodic, and that the prime period is bounded for all positive initial points. A lower bound, growing faster than polynomially, on the maximum prime period for a system of size k is given, based on a model designed to generate long periods. Conditions for systems to have unbounded preperiods are given. All cases of nonpositive systems, with either the A values and/or initial x values allowed to be negative, are analyzed. For all cases conditions are given for solutions to exist, for the solution to be bounded, and for it to be eventually periodic. Finally, we examine several other difference systems, to see if the methods developed in this paper can be applied to them.
Description
Keywords
reciprocal, difference equation, eventually periodic, preperiod, delay, periodic, maximum
Citation
Degree
PhD
Discipline
Mathematics
