arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.00489math.DS

Measure-Theoretically Mixing Subshifts with Low Complexity

Darren Creutz, Ronnie Pavlov, Shaun Rodock

英文摘要:

We introduce a class of rank-one transformations, which we call extremely elevated staircase transformations. We prove that they are measure-theoretically mixing and, for any $f : \mathbb{N} \to \mathbb{N}$ with $f(n)/n$ increasing and $\sum 1/f(n) < \infty$, that there exists an extremely elevated staircase with word complexity $p(n) = o(f(n))$. This improves the previously lowest known complexity for mixing subshifts, resolving a conjecture of Ferenczi.

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

↑