区间映射序模式的分布
Distributions of order patterns of interval maps
摘要:
描述点$x$在区间$I=[0,1]$的自映射$f$下的第一个$n$迭代的相对阶的置换$σ$被称为\emph{order pattern}。对于固定的$f$和$n$,测量生成顺序模式$σ$的点$x\in I$(根据勒贝格测度)给出了长度$n$排列集合上的概率分布$μ_n(f)$。我们研究的分布,出现这种方式为各类功能$f$。我们的主要结果处理类的措施保持功能。在这种情况下,我们得到一个精确的描述的一组可实现的分布:对于每个$n$这组是一个工会的开放面的多面体流在一定的有向图,一个简单的组合准则确定哪些面包括在内。我们还表明,对于一般的$f$,除了一个明显的兼容性条件,有没有限制序列$\{μ_n(f)\}$为$n=1,2,...$。此外,我们还给出了$f$具有\emph{finite exclusion type}的一个必要条件,即,因为存在有限多个顺序模式,这些模式生成$f$未实现的所有顺序模式。利用熵,我们表明,如果$f$是分段连续的,分段单调,遍历或任意高的周期点,那么$f$不能有有限的排斥型。这推广了S.伊丽莎白
英文摘要:
A permutation $σ$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according to Lebesgue measure) that generate the order pattern $σ$ gives a probability distribution $μ_n(f)$ on the set of length $n$ permutations. We study the distributions that arise this way for various classes of functions $f$. 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 $n$ 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 $f$, apart from an obvious compatibility condition, there is no restriction on the sequence $\{μ_n(f)\}$ for $n=1,2,...$. In addition, we give a necessary condition for $f$ to have \emph{finite exclusion type}, i.e., for there to be finitely many order patterns that generate all order patterns not realized by $f$. Using entropy we show that if $f$ is piecewise continuous, piecewise monotone, and either ergodic or with points of arbitrarily high period, then $f$ cannot have finite exclusion type. This generalizes results of S. Elizalde.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。