The Periodic Integer Orbits of Polynomial Recursions With Integer Coefficients

Authors

  • Hassan Sedaghat Professor Emeritus of Mathematics Virginia Commonwealth University Richmond, VA 23284

DOI:

https://doi.org/10.5644/SJM.18.01.08

Keywords:

periodic integer orbit

Abstract

We show that polynomial recursions $x_{n+1}=x_{n}^{m}-k$ where $k,m$ are integers and $m$ is positive have no nontrivial periodic integer orbits for $m\geq3$. If $m=2$ then we show that the recursion has integer two-cycles for infinitely many values of $k$ but no higher period orbits. We further show that these statements are true for all quadratic recursions and comment on possible higher order extensions.

 

Statistics

Abstract: 51  /   PDF: 31

 

References

T. Li and J.A. Yorke, Period three implies chaos, American Mathematical Monthly, 82, (1973) 985-992.

J. Bektešević, M.R.S. Kulenović and E. Pilav, Global dynamics of quadratic second order difference equation in the first quadrant, Appl. Math. Comput, 227 (2014) 50-65.

H. Sedaghat, Nonlinear Difference Equations: Theory with Applications to Social Science Models, Springer, New York, 2003.

Downloads

Published

17.01.2024

How to Cite

Sedaghat, H. . (2024). The Periodic Integer Orbits of Polynomial Recursions With Integer Coefficients. Sarajevo Journal of Mathematics, 18(1), 107–125. https://doi.org/10.5644/SJM.18.01.08

Issue

Section

Articles