2000 character limit reached
Pseudorandomness of the Ostrowski sum-of-digits function
Published 9 Nov 2016 in math.NT | (1611.03043v1)
Abstract: For an irrational $\alpha\in(0,1)$, we investigate the Ostrowski sum-of-digits function $\sigma_\alpha$. For $\alpha$ having bounded partial quotients and $\vartheta\in\mathbb R\setminus\mathbb Z$, we prove that the function $g:n\mapsto \mathrm e(\vartheta \sigma_\alpha(n))$, where $\mathrm e(x)=\mathrm e{2\pi i x}$, is pseudorandom in the following sense: for all $r\in\mathbb N$ the limit [\gamma_r= \lim_{N\rightarrow\infty}\frac 1N\sum_{0\leq n<N}g(n+r)\overline{g(n)} ] exists and we have [\lim_{R\rightarrow\infty}\frac 1R\sum_{0\leq r<R}\bigl\lvert \gamma_r\bigr\rvert2=0.]
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.