Besicovitch covering numbers for B-free and other shifts

Abstract

For a finite alphabet A define by d1(x,y):=n∞12n+1\#\|i| n: xi≠ yi\ the Besicovitch pseudo-metric on A Z. It is well known that a closed subshift of A Z has finite covering numbers w.r.t. d1 if and only if it is mean-equicontinuous. Here we study, more generally, the scaling behavior of these covering numbers for individual orbits which are generic for an ergodic measure μ on A Z with discrete spectrum, and we explore their usefulness as invariants for block code equivalence. We illustrate this by developing tools to determine these covering numbers for various classes of B-free numbers (in particular also for square-free numbers), and we provide a continuous family of measures μs, all with the same discrete spectrum generated by a single number, but such that μs- and μs'-typical x resp. x'∈ A Z have sufficiently different growth of covering numbers such that there are no finite block codes mapping x x' and x' x. (Indeed, both orbits have different amorphic complexities.)

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…