Difference equations with delay
Article
Received:
- 72 Downloads
- 3 Citations
Abstract
In this note we employ combinatorial arguments to count and classify certain periodic solutions of the delayed difference equationx(n) = f(x(n − k)), withk ≥ 2 given andn ∈ ℤ, The periodic solutions that we consider are formed by combiningk copies of anm- periodic solution of the “ordinary” difference equationx(n) =f(x(n- 1)). We also briefly discuss the possibility of braiding different periodic solutions of the ordinary difference equation into a periodic solution of the delayed version.
Key words
delayed difference equation periodic patterns necklacesReferences
- [1]E.R. Berlekamp, Algebraic Coding Theory. McGraw-Hill, 1968.Google Scholar
- [2]H. Predrickson and I.J. Kessler, An algorithm for generating necklaces of beads in two colors. Discrete Mathematics,61 (1986), 181–188.CrossRefMathSciNetGoogle Scholar
- [3]S.W. Golomb, Irreducible polynomials, synchronization codes, primitive necklaces, and the cyclotomic algebra. Combinatorial Mathematics and its Applications (eds. R.C. Rose and T.A. Dowlings), The University of North Carolina Press, 1967, Chapter 21.Google Scholar
- [4]P.W.H. Lemmens and T.A. Springer, Hoofdstukken uit de combinatoriek. Epsilon, 1992.Google Scholar
- [5]R.L. Miller, Necklaces, symmetries and self-reciprocal polynomials. Discrete Mathematics,22 (1978), 25–33.MATHCrossRefMathSciNetGoogle Scholar
- [6]O. Diekmann, J.R. ten Donkelaar and S.D. Mylius, Saumon à la Kaitala & Getz, sauce hollandaise. Evol. Ecol. Research,1 (1999), 261–275.Google Scholar
- [7]J.H. van Lint and R.M. Wilson, A Course in Combinatorics. Cambridge University Press, 1992.Google Scholar
Copyright information
© JJIAM Publishing Committee 2000