English

Helson's problem for sums of a random multiplicative function

Number Theory 2015-12-09 v2 Complex Variables Functional Analysis Probability

Abstract

We consider the random functions SN(z):=n=1Nz(n)S_N(z):=\sum_{n=1}^N z(n) , where z(n)z(n) is the completely multiplicative random function generated by independent Steinhaus variables z(p)z(p). It is shown that ESNN(logN)0.05616{\Bbb E} |S_N|\gg \sqrt{N}(\log N)^{-0.05616} and that (ESNq)1/qqN(logN)0.07672({\Bbb E} |S_N|^q)^{1/q}\gg_{q} \sqrt{N}(\log N)^{-0.07672} for all q>0q>0.

Keywords

Cite

@article{arxiv.1411.6388,
  title  = {Helson's problem for sums of a random multiplicative function},
  author = {Andriy Bondarenko and Kristian Seip},
  journal= {arXiv preprint arXiv:1411.6388},
  year   = {2015}
}

Comments

This version of the paper has been accepted for publication in Mathematika

R2 v1 2026-06-22T07:09:35.324Z