2000 character limit reached
Helson's problem for sums of a random multiplicative function
Published 24 Nov 2014 in math.NT, math.CV, math.FA, and math.PR | (1411.6388v2)
Abstract: We consider the random functions $S_N(z):=\sum_{n=1}N z(n) $, where $z(n)$ is the completely multiplicative random function generated by independent Steinhaus variables $z(p)$. It is shown that ${\Bbb E} |S_N|\gg \sqrt{N}(\log N){-0.05616}$ and that $({\Bbb E} |S_N|q){1/q}\gg_{q} \sqrt{N}(\log N){-0.07672}$ for all $q>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.