A survey on the topological entropy of cubic polynomials
Noah Cockram, Ana Rodrigues
TL;DR
This paper reviews algorithms for calculating the topological entropy of cubic polynomials and applies one to compute isentropes, providing insights into their dynamical complexity.
Contribution
It offers a comparative discussion of algorithms and applies a specific method to cubic polynomials for entropy computation.
Findings
Comparison of two algorithms for topological entropy calculation
Application of an algorithm to compute isentropes for cubic polynomials
Insights into the dynamical behavior of cubic polynomials
Abstract
In this paper we discuss two different existing algorithms for computing topological entropy and we perform one of them in order to compute the isentropes for cubic polynomials.
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
TopicsMathematical Dynamics and Fractals · Chaos control and synchronization · Functional Equations Stability Results