Abstract
Iff is a continuous self-map of a compact interval we can represent each finite fully invariant set off by a permutation. We can then calculate the topological entropy of the permutation. This provides us with a numerical measure of complexity for any map which exhibits a given permutation type. In this paper we present cyclic and noncyclic permutations which have maximum topological entropy amongst all cyclic or noncyclic permutations of the same length.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
