2000 character limit reached
Predictive Sets
Published 12 Nov 2019 in math.DS and math.PR | (1911.04935v4)
Abstract: A set $P\subset \mathbb N$ is called predictive if for any zero entropy finite-valued stationary process $(X_i){i\in \mathbb Z}$, $X_0$ is measurable with respect to $(X_i){i\in P}$. We know that $\mathbb N$ is a predictive set. In this paper we give sufficient conditions and necessary ones for a set to be predictive. We also discuss linear predictivity, predictivity among Gaussian processes and relate these to Riesz sets which arise in harmonic analysis.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.