An alternative construction of normal numbers
A new class of \(b\)-adic normal numbers is built recursively by using Eulerian paths in a sequence of de Bruijn digraphs. In this recursion, a path is constructed as an extension of the previous one in such a way that the \(b\)-adic block determined by the path contains the maximal number of different \(b\)-adic subblocks of consecutive lengths in the most compact arrangement. Any source of redundancy is avoided at every step. This recursive construction is an alternative to the several well-known concatenative constructions à la Champernowne.
- Conditional limit theorems under Markov conditioning
- Discrepancy estimates for a class of normal numbers
- Discrepancy of normal numbers
- scientific article; zbMATH DE number 3882430 (Why is no real title available?)
- scientific article; zbMATH DE number 3903723 (Why is no real title available?)
- scientific article; zbMATH DE number 124416 (Why is no real title available?)
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- Normal \(k\)-tuples
- Normal Recurring Decimals
- Note on normal numbers
- General constructions of normal numbers of Korobov type
- Normal numbers and nested perfect necklaces
- Some negative results related to Poissonian pair correlation problems
- Low discrepancy sequences failing Poissonian pair correlations
- An experimental investigation of the normality of irrational algebraic numbers
- A combinatorial method for constructing normal numbers
- Normal numbers and computer science
- Self-normal numbers
This page was built for publication: An alternative construction of normal numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5939703)