Normality and finite-state dimension of Liouville numbers

DOI10.1007/S00224-014-9554-8zbMATH Open1345.68183arXiv1204.4104OpenAlexW2024776286WikidataQ114230789 ScholiaQ114230789MaRDI QIDQ285510FDOQ285510

Authors: S. Nandakumar, Santhosh Kumar Vangapelli 

Publication date: 19 May 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Abstract: Liouville numbers were the first class of real numbers which were proven to be transcendental. It is easy to construct non-normal Liouville numbers. Kano and Bugeaud have proved, using analytic techniques, that there are normal Liouville numbers. Here, for a given base k >= 2, we give two simple constructions of a Liouville number which is normal to the base k. The first construction is combinatorial, and is based on de Bruijn sequences. A real number in the unit interval is normal if and only if its finite-state dimension is 1. We generalize our construction to prove that for any rational r in the closed unit interval, there is a Liouville number with finite state dimension r. This refines Staiger's result that the set of Liouville numbers has constructive Hausdorff dimension zero, showing a new quantitative classification of Liouville numbers can be attained using finite-state dimension. In the second number-theoretic construction, we use an arithmetic property of numbers - the existence of primitive roots - to construct Liouville numbers normal in finitely many bases, assuming a Generalized Artin's conjecture on primitive roots.

Full work available at URL: https://arxiv.org/abs/1204.4104

Recommendations

• A computable absolutely normal Liouville number
• scientific article; zbMATH DE number 3345491
• Liouville, computable, Borel normal and Martin-Löf random numbers

zbMATH Keywords

normal numbersfinite-state dimensionLiouville numbersradix expansion

Mathematics Subject Classification ID

Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• The Kolmogorov complexity of real numbers.
• Finite-state dimension
• Endliche Automaten und Zufallsfolgen
• Compression of individual sequences via variable-rate coding
• A computable absolutely normal Liouville number
• Title not available (Why is that?)
• Entropy rates and finite-state dimension
• Distribution modulo one and Diophantine approximation
• General constructions of normal numbers of Korobov type
• The Construction of Decimals Normal in the Scale of Ten
• Title not available (Why is that?)
• Normal Recurring Decimals
• Liouville numbers and normal numbers

Cited In (3)

• Title not available (Why is that?)
• A computable absolutely normal Liouville number
• Liouville, computable, Borel normal and Martin-Löf random numbers

This page was built for publication: Normality and finite-state dimension of Liouville numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285510)