Abstract
Let L=(Ld)d∈N be any ordered probability sequence, i.e., satisfying 0<Ld+1≤Ld for each d∈N and ∑d∈NLd=1. We construct sequences A=(ai)i∈N on the countably infinite alphabet N in which each possible block of digits α1,…,αk∈N, k∈N, occurs with frequency ∏d=1kLαd. In other words, we construct L-normal sequences. These sequences can then be projected to normal numbers in various affine number systems, such as real numbers x∈[0,1] that are normal in GLS number systems that correspond to the sequence L or higher dimensional variants. In particular, this construction provides a family of numbers that have a normal Lüroth expansion.
| Original language | English |
|---|---|
| Article number | 101945 |
| Pages (from-to) | 1-25 |
| Number of pages | 25 |
| Journal | Journal of Complexity |
| Volume | 89 |
| Early online date | 4 Apr 2025 |
| DOIs | |
| Publication status | Published - Aug 2025 |
Bibliographical note
Publisher Copyright:© 2025 The Authors
Keywords
- Digit frequency
- GLS expansions
- Lüroth expansions
- Normal numbers
Fingerprint
Dive into the research topics of 'Constructions of normal numbers with infinite digit sets'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver