On the construction of absolutely normal numbers
From MaRDI portal
Abstract: We give a construction of an absolutely normal real number such that for every integer greater than or equal to , the discrepancy of the first terms of the sequence is of asymptotic order . This is below the order of discrepancy which holds for almost all real numbers. Even the existence of absolutely normal numbers having a discrepancy of such a small asymptotic order was not known before.
Recommendations
Cited in
(17)- General constructions of normal numbers of Korobov type
- Computing absolutely normal numbers in nearly linear time
- Normal numbers and nested perfect necklaces
- On the Normality of Arithmetical Constants
- Cantor series constructions of sets of normal numbers
- A constructible set of normals with positive measure
- scientific article; zbMATH DE number 4181445 (Why is no real title available?)
- A polynomial-time algorithm for computing absolutely normal numbers
- Avoiding or limiting regularities in words
- Normal numbers and computer science
- Normal numbers and the normality measure
- Computable absolutely normal numbers and discrepancies
- M. Levin's construction of absolutely normal numbers with very low discrepancy
- A simple construction of absolutely disjunctive Liouville numbers
- Real numbers equally compressible in every base
- Agafonov's theorem for finite and infinite alphabets and probability distributions different from equidistribution
- Super-dense sets and their role in the theory of normal numbers
This page was built for publication: On the construction of absolutely normal numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595439)