2000 character limit reached
Equality of Kolmogorov-Sinai and permutation entropy for one-dimensional maps consisting of countably many monotone parts
Published 20 Jul 2018 in math.DS | (1807.07881v2)
Abstract: In this paper, we show that, under some technical assumptions, the Kolmogorov-Sinai entropy and the permutation entropy are equal for one-dimensional maps if there exists a countable partition of the domain of definition into intervals such that the considered map is monotone on each of those intervals. This is a generalization of a result by Bandt, Pompe and G. Keller, who showed that the above holds true under the additional assumptions that the number of intervals on which the map is monotone is finite and that the map is continuous on each of those intervals.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.