The exact order of discrepancy for Levin's normal number in base 2

preprint2022arXivOpen access

Abstract

Mordechay Levin has constructed a number αα which is normal in base 2, and such that the sequence {2nα}n=0,1,2,…\left\{2^n α\right\}_{n=0,1,2,\ldots} has very small discrepancy DND_N. Indeed we have N⋅DN=O((log⁡N)2)N\cdot D_N = \mathcal{O} \left(\left(\log N\right)^2\right). That means, that αα is normal of extremely high quality. In this paper we show that this estimate is best possible, i.e., N⋅DN≥c⋅(log⁡N)2N\cdot D_N \geq c \cdot \left(\log N\right)^2 for infinitely many NN.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.