Papers
Topics
Authors
Recent
Search
2000 character limit reached

Normal numbers with digit dependencies

Published 9 Apr 2018 in math.NT, cs.FL, math.CO, and math.PR | (1804.02844v2)

Abstract: 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, still, almost all real numbers are normal. Our theorem states that almost all real numbers are normal when at least slightly more than $\log \log n$ consecutive digits with indices starting at position $n$ are independent. As the main application, we consider the Toeplitz set $T_P$, which is the set of all sequences $a_1a_2 \ldots $ of symbols from ${0, \ldots, b-1}$ such that $a_n$ is equal to $a_{pn}$, for every $p$ in $P$ and $n=1,2,\ldots$. Here $b$ is an integer base and $P$ is a finite set of prime numbers. We show that almost every real number whose base $b$ expansion is in $T_P$ is normal to base $b$. In the case when $P$ is the singleton set ${2}$ we prove that more is true: almost every real number whose base $b$ expansion is in $T_P$ is normal to all integer bases. We also consider the Toeplitz transform which maps the set of all sequences to the set $T_P$ and we characterize the normal sequences whose Toeplitz transform is normal as well.

Citations (2)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.