Search arXivSearch

arXiv · 0908.4034

Words and Transcendence

Abstract

Is it possible to distinguish algebraic from transcendental real numbers by considering the $b$-ary expansion in some base $b\ge2$? In 1950, É. Borel suggested that the answer is no and that for any real irrational algebraic number $x$ and for any base $g\ge2$, the $g$-ary expansion of $x$ should satisfy some of the laws that are shared by almost all numbers. There is no explicitly known example of a triple $(g,a,x)$, where $g\ge3$ is an integer, $a$ a digit in $\{0,...,g-1\}$ and $x$ a real irrational algebraic number, for which one can claim that the digit $a$ occurs infinitely often in the $g$-ary expansion of $x$. However, some progress has been made recently, thanks mainly to clever use of Schmidt's subspace theorem. We review some of these results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michel Waldschmidt. 2009-08-27. Words and Transcendence. https://arxiv.org/abs/0908.4034

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT