arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2301.09786math.DS
收藏

弱混合系统中例外集的大小

Size of exceptional sets in weakly mixing systems

Stanford University(斯坦福大学);Seoul National University(首尔大学)

Jiyun Park, Kangrae Park

AI总结:

本文研究了Chacon变换及一类称为限制紧映射的切割-堆叠变换的例外集,构造了统一的例外集J,并证明了其在对数尺度下的有效性,同时探讨了弱混合模型中的例外集障碍问题。

摘要:

我们研究了Chacon变换以及更一般的一类称为限制紧映射的切割-堆叠变换的例外集。对于这些系统,我们显式地构造了一个通用的例外集J⊆N,对所有可测对A,B∈B都有效,使得对于每一个递增函数h:N→R>0,发散到无穷大,|J∩[0,n]|≤(log n)^{h(n)}对所有足够大的n成立。本文考虑的Chacon变换属于此类,给出了一个对数尺度的通用例外集。我们还证明了这个对数尺度在配对障碍水平上本质上是尖锐的:对于每一个紧映射,没有在最后一列上方的空格,即s_{m-1}=0,并且对于每一个t>0,存在可测集A,B使得每个例外集J对于(A,B)满足|J∩[0,n]|≥(log n)^t对所有足够大的n成立。该构造基于递归公式,这些公式来自于切割-堆叠结构中的返回时间分布。作为补充的定量原理,我们显示如果对应的p-次Cesàro弱混合平均满足速率o(b_N),则J_{A,B}可以被选择使得|J_{A,B}∩[0,N]|=o(Nb_N)。我们应用这个速率到例外集原理到多个弱混合模型,包括区间交换变换、翻译流和替换动力系统,基于可用的定量估计的正则性假设。我们还构造了一个单独的弱混合一个空格秩一例子,在其中例外集障碍具有多项式下增长。

英文摘要:

We study exceptional sets for the Chacon transformation and, more generally, for a class of cutting-and-stacking transformations called restrictive tight maps. For these systems we explicitly construct a universal exceptional set \(J\subseteq\mathbb{N}\), valid uniformly for all measurable pairs \(A,B\in\mathscr{B}\), such that for every increasing function \(h:\mathbb{N}\to\mathbb{R}_{>0}\) diverging to infinity, \(|J\cap[0,n]|\le(\log n)^{h(n)}\) for all sufficiently large \(n\). The Chacon transformation considered in this paper belongs to this class, giving a logarithmic-scale universal exceptional set for Chacon. We also prove that this logarithmic scale is essentially sharp at the level of pairwise obstructions: for every tight map with no spacers above the last subcolumn, i.e. \(s_{m-1}=0\), and every \(t>0\), there exist measurable sets \(A,B\) such that every exceptional set \(J\) for \((A,B)\) satisfies \(|J\cap[0,n]|\ge(\log n)^t\) for all sufficiently large \(n\). The construction is based on recursive formulas for return-time distributions arising from the cutting-and-stacking structure. As a complementary quantitative principle, we show that if the corresponding \(p\)-th Cesàro weak-mixing averages satisfy a rate \(o(b_N)\), then \(J_{A,B}\) may be chosen so that \(|J_{A,B}\cap[0,N]|=o(Nb_N)\). We apply this rate-to-exceptional-set principle to several weakly mixing models, including interval exchange transformations, translation flows, and substitution dynamical systems, under the regularity assumptions of the available quantitative estimates. We also construct a separate weakly mixing one-spacer rank-one example in which exceptional-set obstructions have polynomial lower growth.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑