Patterns in rational base number systems

From MaRDI portal
Publication:485129

DOI10.1007/S00041-012-9246-1zbMATH Open1320.11006arXiv1203.4919OpenAlexW3099975487MaRDI QIDQ485129FDOQ485129

Johannes F. Morgenbesser, Jörg M. Thuswaldner, Wolfgang Steiner

Publication date: 9 January 2015

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Abstract: Number systems with a rational number a/b>1 as base have gained interest in recent years. In particular, relations to Mahler's 3/2-problem as well as the Josephus problem have been established. In the present paper we show that the patterns of digits in the representations of positive integers in such a number system are uniformly distributed. We study the sum-of-digits function of number systems with rational base a/b and use representations w.r.t. this base to construct normal numbers in base a in the spirit of Champernowne. The main challenge in our proofs comes from the fact that the language of the representations of integers in these number systems is not context-free. The intricacy of this language makes it impossible to prove our results along classical lines. In particular, we use self-affine tiles that are defined in certain subrings of the ad'ele ring mathbbAmathbbQ and Fourier analysis in mathbbAmathbbQ. With help of these tools we are able to reformulate our results as estimation problems for character sums.


Full work available at URL: https://arxiv.org/abs/1203.4919




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Patterns in rational base number systems

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