Minimal zero entropy subshifts can be unrestricted along any sparse set

Abstract We present a streamlined proof of a result essentially presented by the author in [Some counterexamples in topological dynamics. Ergod. Th. & Dynam. Sys. 28 (4) (2008), 1291–1322], namely that for every set $S = \{s_1, s_2, \ldots \} \subset \mathbb {N}$ of zero Banach density and finite set A , there exists a minimal zero-entropy subshift $(X, \sigma )$ so that for every sequence $u \in A^{\mathbb {Z}}$ , there is $x_u \in X$ with $x_u(s_n) = u(n)$ for all $n \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 reported by Eisner [A polynomial version of Sarnak’s conjecture. C. R. Math. Acad. Sci. Paris 353 (7) (2015), 569–572] which are significantly more general than some recently provided by Kanigowski, Lemańczyk and Radziwiłł [Prime number theorem for analytic skew products. Ann. of Math. (2) 199 (2024), 591–705] and by Lian and Shi [A counter-example for polynomial version of Sarnak’s conjecture. Adv. Math. 384 (2021), Paper no. 107765] and shows that no similar result can hold under only the assumptions of minimality and zero entropy.

Authors

Institutions

Publication Details

Journal
Ergodic Theory and Dynamical Systems
Published
2024-09-09
DOI
https://doi.org/10.1017/etds.2024.42
Primary Topic
Cellular Automata and Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Minimal zero entropy subshifts can be unrestricted along any sparse set

Ronnie Pavlov
Ergodic Theory and Dynamical Systems
Cellular Automata and Applications
article

Minimal zero entropy subshifts can be unrestricted along any sparse set

Ronnie Pavlov
article en

Abstract

Abstract We present a streamlined proof of a result essentially presented by the author in [Some counterexamples in topological dynamics. Ergod. Th. & Dynam. Sys. 28 (4) (2008), 1291–1322], namely that for every set $S = \{s_1, s_2, \ldots \} \subset \mathbb {N}$ of zero Banach density and finite set A , there exists a minimal zero-entropy subshift $(X, \sigma )$ so that for every sequence $u \in A^{\mathbb {Z}}$ , there is $x_u \in X$ with $x_u(s_n) = u(n)$ for all $n \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 reported by Eisner [A polynomial version of Sarnak’s conjecture. C. R. Math. Acad. Sci. Paris 353 (7) (2015), 569–572] which are significantly more general than some recently provided by Kanigowski, Lemańczyk and Radziwiłł [Prime number theorem for analytic skew products. Ann. of Math. (2) 199 (2024), 591–705] and by Lian and Shi [A counter-example for polynomial version of Sarnak’s conjecture. Adv. Math. 384 (2021), Paper no. 107765] and shows that no similar result can hold under only the assumptions of minimality and zero entropy.

Ergodic Theory and Dynamical SystemsVol. 45(2)
University of Denver (US)
Simons Foundation
Openalex Percentile: Top 82%
Cellular Automata and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Minimal zero entropy subshifts can be unrestricted along any sparse set — Ronnie Pavlov · Ergodic Theory and Dynamical Systems (2024) | TGRS Research Map | TGRS