English

Minimal zero entropy subshifts can be unrestricted along any sparse set

Dynamical Systems 2025-01-15 v1

Abstract

We present a streamlined proof of a result essentially present in previous work of the author, namely that for every set S={s1,s2,}NS = \{s_1, s_2, \ldots\} \subset \mathbb{N} of zero Banach density and finite set AA, there exists a minimal zero-entropy subshift (X,σ)(X, \sigma) so that for every sequence uAZu \in A^\mathbb{Z}, there is xuXx_u \in X with xu(sn)=u(n)x_u(s_n) = u(n) for all nNn \in \mathbb{N}. Informally, minimal deterministic sequences can achieve completely arbitrary behavior upon restriction to a set of zero Banach density. As a corollary, this provides counterexamples to the Polynomial Sarnak Conjecture which are significantly more general than some recently provided in word of Kanigowski, Lema\'{n}czyk, and Radziwi\l\l and of Lian and Shi, and shows that no similar result can hold under only the assumptions of minimality and zero entropy.

Cite

@article{arxiv.2308.08013,
  title  = {Minimal zero entropy subshifts can be unrestricted along any sparse set},
  author = {Ronnie Pavlov},
  journal= {arXiv preprint arXiv:2308.08013},
  year   = {2025}
}
R2 v1 2026-06-28T11:56:30.411Z