English

Constructions of normal numbers with infinitely many digits

Number Theory 2024-02-23 v1

Abstract

Let L=(Ld)dNL=(L_d)_{d \in \mathbb N} be any ordered probability sequence, i.e., satisfying 0<Ld+1Ld0 < L_{d+1} \le L_d for each dNd \in \mathbb N and dNLd=1\sum_{d \in \mathbb N} L_d =1. We construct sequences A=(ai)iNA = (a_i)_{i \in \mathbb N} on the countably infinite alphabet N\mathbb N in which each possible block of digits α1,,αkN\alpha_1, \ldots, \alpha_k \in \mathbb N, kNk \in \mathbb N, occurs with frequency d=1kLαd\prod_{d=1}^k L_{\alpha_d}. In other words, we construct LL-normal sequences. These sequences can then be projected to normal numbers in various affine number systems, such as real numbers x[0,1]x \in [0,1] that are normal in GLS number systems that correspond to the sequence LL or higher dimensional variants. In particular, this construction provides a family of numbers that have a normal L\"uroth expansion.

Keywords

Cite

@article{arxiv.2402.14500,
  title  = {Constructions of normal numbers with infinitely many digits},
  author = {Aafko Boonstra and Charlene Kalle},
  journal= {arXiv preprint arXiv:2402.14500},
  year   = {2024}
}

Comments

21 pages, 3 figures

R2 v1 2026-06-28T14:57:01.593Z