scientific article; zbMATH DE number 32088

From MaRDI portal
Publication:3988089





Let \(s(n)\) be the sum of the binary digits of the integer \(n\), and \(\varepsilon(n)=(s(n)\bmod 2)\) (\(\varepsilon\) is the celebrated Prouhet- Thue-Morse sequence). The real number \(\sum^{+\infty}_{n=0}\varepsilon(n)2^{-n}\) is transcendental; this has been proved by \textit{M. Dekking} [C. R. Acad. Sci., Paris, Sér. A 285, 157-160 (1977; Zbl 0362.10028)], but is also a particular case of a recent general theorem of Loxton and van der Poorten (quoted in the paper under review) which asserts that a real number with automatic digits is either trivial (i.e. rational) or transcendental. In this paper the authors study the numbers \(\sum e_ P^{(r)}(n)/ r^ n\), where \(e_ P^{(r)}(n)\) is the canonical reduction \(\bmod\;r\) of the number of (possibly overlapping) occurrences of the block (pattern) \(P\) in the \(k\)-expansion of the integer \(n\) (\(k\) is a given base). The authors prove that these numbers are transcendental except when \(k=3\), \(P=1\), \(r=2\) (in this case the real number is 2/3). Actually they prove a more general result on the \(\mathbb{Q}\)-linear independence of such numbers by studying in detail periodicity properties of linear combinations of the \((e_ P^{(r)})\)'s, and applying the theorem of Loxton and van der Poorten.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988089)