Distributions of order patterns of interval maps
Aaron Abrams, Eric Babson, Henry Landau, Zeph Landau, and James, Pommersheim

TL;DR
This paper characterizes the distributions of order patterns generated by interval maps, especially measure-preserving functions, and explores conditions for finite exclusion type using combinatorial and entropy methods.
Contribution
It provides an exact description of realizable distributions for measure-preserving interval maps and establishes conditions for finite exclusion type.
Findings
The set of realizable distributions forms a union of open faces of a polytope.
For general functions, the sequence of distributions is unrestricted beyond compatibility.
Piecewise monotone maps with certain properties cannot have finite exclusion type.
Abstract
A permutation describing the relative orders of the first iterates of a point under a self-map of the interval is called an \emph{order pattern}. For fixed and , measuring the points (according to Lebesgue measure) that generate the order pattern gives a probability distribution on the set of length permutations. We study the distributions that arise this way for various classes of functions . Our main results treat the class of measure preserving functions. We obtain an exact description of the set of realizable distributions in this case: for each this set is a union of open faces of the polytope of flows on a certain digraph, and a simple combinatorial criterion determines which faces are included. We also show that for general , apart from an obvious compatibility condition, there is no restriction on…
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
