Minimal zero entropy subshifts can be unrestricted along any sparse set

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, …\ ⊂ N of zero Banach density and finite set A, there exists a minimal zero-entropy subshift (X, σ) so that for every sequence u ∈ AZ, there is xu ∈ X with xu(sn) = u(n) for all n ∈ 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\'nczyk, and Radziwi and of Lian and Shi, and shows that no similar result can hold under only the assumptions of minimality and zero entropy.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…