English

Dimensions of Copeland-Erdos Sequences

Computational Complexity 2007-07-13 v1 Information Theory math.IT

Abstract

The base-kk {\em Copeland-Erd\"os sequence} given by an infinite set AA of positive integers is the infinite sequence \CEk(A)\CE_k(A) formed by concatenating the base-kk representations of the elements of AA in numerical order. This paper concerns the following four quantities. The {\em finite-state dimension} \dimfs(\CEk(A))\dimfs (\CE_k(A)), a finite-state version of classical Hausdorff dimension introduced in 2001. The {\em finite-state strong dimension} \Dimfs(\CEk(A))\Dimfs(\CE_k(A)), a finite-state version of classical packing dimension introduced in 2004. This is a dual of \dimfs(\CEk(A))\dimfs(\CE_k(A)) satisfying \Dimfs(\CEk(A))\Dimfs(\CE_k(A)) \dimfs(\CEk(A))\geq \dimfs(\CE_k(A)). The {\em zeta-dimension} \Dimzeta(A)\Dimzeta(A), a kind of discrete fractal dimension discovered many times over the past few decades. The {\em lower zeta-dimension} \dimzeta(A)\dimzeta(A), a dual of \Dimzeta(A)\Dimzeta(A) satisfying \dimzeta(A)\Dimzeta(A)\dimzeta(A)\leq \Dimzeta(A). We prove the following. \dimfs(\CEk(A))\dimzeta(A)\dimfs(\CE_k(A))\geq \dimzeta(A). This extends the 1946 proof by Copeland and Erd\"os that the sequence \CEk(PRIMES)\CE_k(\mathrm{PRIMES}) is Borel normal. \Dimfs(\CEk(A))\Dimzeta(A)\Dimfs(\CE_k(A))\geq \Dimzeta(A). These bounds are tight in the strong sense that these four quantities can have (simultaneously) any four values in [0,1][0,1] satisfying the four above-mentioned inequalities.

Cite

@article{arxiv.cs/0508001,
  title  = {Dimensions of Copeland-Erdos Sequences},
  author = {Xiaoyang Gu and Jack H. Lutz and Philippe Moser},
  journal= {arXiv preprint arXiv:cs/0508001},
  year   = {2007}
}

Comments

19 pages

R2 v1 2026-07-22T12:23:58.287Z