Real numbers equally compressible in every base

This work solves an open question in finite-state compressibility posed by Lutz and Mayordomo about compressibility of real numbers in different bases. Finite-state compressibility, or equivalently, finite-state dimension, quantifies the asymptotic lower density of information in an infinite sequence. Absolutely normal numbers, being finite-state incompressible in every base, are precisely those numbers which have finite-state dimension equal to 1 in every base. At the other extreme, for example, every rational number has finite-state dimension equal to 0 in every base. Generalizing this, Lutz and Mayordomo posed the question: are there numbers which have absolute positive finite-state dimension strictly between 0 and 1 - equivalently, is there a real number ξ and a compressibility ratio s ∈ (0, 1) such that for every base b , the compressibility ratio of the base- b expansion of ξ is precisely s ? It is conceivable that there is no such number. Indeed, some works explore “zero-one” laws for other feasible dimensions - i.e. sequences with certain properties either have feasible dimension 0 or 1, taking no value strictly in between. However, we answer the question of Lutz and Mayordomo affirmatively by proving a more general result. We show that given any sequence of rational numbers \(\langle q_b \rangle _{b=2}^{\infty } \) , we can explicitly construct a single number ξ such that for any base b , the finite-state dimension/compression ratio of ξ in base b is q b . As a special case, this result implies the existence of absolutely dimensioned numbers for any given rational dimension between 0 and 1, as posed by Lutz and Mayordomo. In our construction, we combine ideas from Wolfgang Schmidt’s construction of absolutely normal numbers from Schmidt (1962), upper bounds on the discrepancy of certain sequences and several new estimates related to exponential sums.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Computation Theory
Published
2025-04-18
DOI
https://doi.org/10.1145/3729207
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Real numbers equally compressible in every base

Satyadev Nandakumar, Subin Pulari
ACM Transactions on Computation Theory
Computability, Logic, AI Algorithms
article

Real numbers equally compressible in every base

Satyadev Nandakumar, Subin Pulari
article en

Abstract

This work solves an open question in finite-state compressibility posed by Lutz and Mayordomo about compressibility of real numbers in different bases. Finite-state compressibility, or equivalently, finite-state dimension, quantifies the asymptotic lower density of information in an infinite sequence. Absolutely normal numbers, being finite-state incompressible in every base, are precisely those numbers which have finite-state dimension equal to 1 in every base. At the other extreme, for example, every rational number has finite-state dimension equal to 0 in every base. Generalizing this, Lutz and Mayordomo posed the question: are there numbers which have absolute positive finite-state dimension strictly between 0 and 1 - equivalently, is there a real number ξ and a compressibility ratio s ∈ (0, 1) such that for every base b , the compressibility ratio of the base- b expansion of ξ is precisely s ? It is conceivable that there is no such number. Indeed, some works explore “zero-one” laws for other feasible dimensions - i.e. sequences with certain properties either have feasible dimension 0 or 1, taking no value strictly in between. However, we answer the question of Lutz and Mayordomo affirmatively by proving a more general result. We show that given any sequence of rational numbers \(\langle q_b \rangle _{b=2}^{\infty } \) , we can explicitly construct a single number ξ such that for any base b , the finite-state dimension/compression ratio of ξ in base b is q b . As a special case, this result implies the existence of absolutely dimensioned numbers for any given rational dimension between 0 and 1, as posed by Lutz and Mayordomo. In our construction, we combine ideas from Wolfgang Schmidt’s construction of absolutely normal numbers from Schmidt (1962), upper bounds on the discrepancy of certain sequences and several new estimates related to exponential sums.

ACM Transactions on Computation Theory
Indian Institute of Technology Kanpur (IN)
Openalex Percentile: Top 91%
Computability, Logic, AI Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Real numbers equally compressible in every base — Satyadev Nandakumar, Subin Pulari · ACM Transactions on Computation Theory (2025) | TGRS Research Map | TGRS