Search for cycles in non-linear autonomous discrete dynamical system
D. Dmitrishin, A. Stokolos, M. Tohaneanu

TL;DR
This paper introduces a new polynomial family and a robust algorithm for detecting cycles of any length in non-linear autonomous discrete dynamical systems, supported by numerical examples.
Contribution
It presents a novel polynomial family and an algorithm for cycle detection in non-linear discrete systems, extending previous methods.
Findings
The polynomial family includes Fejér and Suffridge polynomials as special cases.
The proposed algorithm effectively detects cycles of arbitrary length.
Numerical examples demonstrate the algorithm's practical applicability.
Abstract
We construct a family of polynomials with real coefficients that contains as a particular case the Fej\'er and Suffridge polynomials. These polynomials allow us to suggest a robust algorithm to search for cycles of arbitrary length in non-linear autonomous discrete dynamical systems. Numeric examples are included.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum chaos and dynamical systems
