Related papers: Transcendence Meets Normality: Construction of Tra…

We give metric theorems for the property of Borel normality for real numbers under the assumption of digit dependencies in their expansion in a given integer base. We quantify precisely how much digit dependence can be allowed such that,…

A real number $x$ is absolutely normal if, for every base $b\ge 2$, every two equally long strings of digits appear with equal asymptotic frequency in the base-$b$ expansion of $x$. This paper presents an explicit algorithm that generates…

Let $L=(L_d)_{d \in \mathbb N}$ be any ordered probability sequence, i.e., satisfying $0 < L_{d+1} \le L_d$ for each $d \in \mathbb N$ and $\sum_{d \in \mathbb N} L_d =1$. We construct sequences $A = (a_i)_{i \in \mathbb N}$ on the…

Given an integer $b\geqslant 2$ and a set $P$ of prime numbers, the set $T_P $ of Toeplitz numbers comprises all elements of $[0,b[$ whose digits $(a_n)_{n\geqslant 1}$ in the base-$b$ expansion satisfy $a_n=a_{pn}$ for all $p\in P$ and…

We analyze algorithms that output absolutely normal numbers digit-by-digit with respect to quality of convergence to normality of the output, measured by the discrepancy. We consider explicit variants of algorithms by Sierpinski, by Turing…

We give a construction of a real number that is normal to all integer bases and continued fraction normal. The computation of the first n digits of its continued fraction expansion performs in the order of n^4 mathematical operations. The…

We analyze the convergence order of an algorithm producing the digits of an absolutely normal number. Furthermore, we introduce a stronger concept of absolute normality by allowing Pisot numbers as bases, which leads to expansions with…

We construct an absolutely normal number whose continued fraction expansion is normal in the sense that it contains all finite patterns of partial quotients with the expected asymptotic frequency as given by the Gauss-Kuzmin measure. The…

Defined by Borel, a real number is normal to an integer base $b$, greater than or equal to $2$, if in its base-$b$ expansion every block of digits occurs with the same limiting frequency as every other block of the same length. We consider…

Despite the fact that almost all real numbers are absolutely normal---that is, the digits in their expansions to any base occur in all possible configurations with the expected frequency---not one specific example of an absolutely normal…

Generalized L\"uroth series generalize $b$-adic representations as well as L\"uroth series. Almost all real numbers are normal, but it is not easy to construct one. In this paper, a new construction of normal numbers with respect to…

We give a construction of an absolutely normal real number $x$ such that for every integer $b $ greater than or equal to $2$, the discrepancy of the first $N$ terms of the sequence $(b^n x \mod 1)_{n\geq 0}$ is of asymptotic order…

We construct the base $2$ expansion of an absolutely normal real number $x$ so that, for every integer $b$ greater than or equal to $2$, the discrepancy modulo $1$ of the sequence $(b^0 x, b^1 x, b^2 x , \ldots)$ is essentially the same as…

Champernowne famously proved that the number $0.(1)(2)(3)(4)(5)(6)(7)(8)(9)(10)(11)(12)...$ formed by concatenating all the integers one after another is normal base 10. We give a generalization of Champernowne's construction to various…

In the present paper we construct normal numbers in base $q$ by concatenating $q$-ary expansions of pseudo polynomials evaluated at the primes. This extends a recent result by Tichy and the author.

Given a real number $0.a_1a_2 a_3\dots$ that is normal to base $b$, we examine increasing sequences $n_i$ so that the number $0.a_{n_1}a_{n_2}a_{n_3}\dots$ are normal to base $b$. Classically it is known that if the $n_i$ form an arithmetic…

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…

We present a general procedure to generate infinitely many BBP and BBP-like formulas for the simplest transcendental numbers. This provides some insight and a better understanding into their nature. In particular, we can derive the main…

Let $g \geq 2$. A real number is said to be g-normal if its base g expansion contains every finite sequence of digits with the expected limiting frequency. Let \phi denote Euler's totient function, let \sigma be the sum-of-divisors…

It is well known that the set of origami constructible numbers is larger than the classical straight-edge and compass constructible numbers. However, the Huzita-Justin-Hatori origami constructible numbers remain algebraic so that the…