paper

Besicovitch covering numbers for -free and other shifts

arXiv:2505.09253

Abstract

For a finite alphabet define by the Besicovitch pseudo-metric on . It is well known that a closed subshift of has finite covering numbers w.r.t. 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 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 -free numbers (in particular also for square-free numbers), and we provide a continuous family of measures , all with the same discrete spectrum generated by a single number, but such that - and -typical resp. have sufficiently different growth of covering numbers such that there are no finite block codes mapping and . (Indeed, both orbits have different amorphic complexities.)