Destruction of CPE-normality along deterministic sequences
Adam Abrams, Tomasz Downarowicz

TL;DR
This paper investigates how deterministic sequences affect the normality of sequences under various measures, showing that most destroy normality unless they have a very simple structure, especially for measures with positive entropy.
Contribution
It generalizes previous results by demonstrating that deterministic sets typically destroy normality for non-i.i.d. measures with CPE, except for very primitive structures called 'superficial'.
Findings
Deterministic sets with positive lower density preserve normality for i.i.d. measures.
Most deterministic sets destroy normality for measures with positive entropy and non-i.i.d. structure.
Preservation of normality can coexist with various parameters outside the CPE class.
Abstract
Let be a shift-invariant measure on , where is a finite or countable alphabet. We say that an infinite subset (where ) "preserves (destroys) -normality" if, for any generic for , the sequence is (is not) generic for . It is known from Kamae and Weiss that if is i.i.d. then any deterministic set of positive lower density preserves -normality. We show that deterministic sets, except ones with a very primitive structure that we call "superficial", destroy -normality for any non-i.i.d. measure with completely positive entropy (CPE). This generalizes Heersink and Vandehey's result for arithmetic progressions and the Gauss measure (associated to the continued fraction transformation). We give…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Mathematical Dynamics and Fractals · Cellular Automata and Applications
