Author:
CREUTZ DARREN,PAVLOV RONNIE,RODOCK SHAUN
Abstract
AbstractWe 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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,General Mathematics
Reference19 articles.
1. Mixing on a class of rank-one transformations
2. Mixing on rank-one transformations
3. [FGH+21] Foreman, M. , Gao, S. , Hill, A. , Silva, C. E. and Weiss, B. . Rank one transformations, odometers and finite factors. Preprint, 2021, arXiv:1910.12645.
4. [PS22] Pavlov, R. and Schmeiding, S. . On the structure of generic subshifts. Preprint, 2022, arXiv:2203.15159.
5. Subsystems of transitive subshifts with linear complexity
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献