Answers are grounded in this paper and cite their sources.
We examine the conditions under which the sum of random multiplicative functions in short intervals, given by ∑x<n x+y f(n), exhibits the phenomenon of better than square-root cancellation. We establish that the point at which the square-root cancellation diminishes significantly is approximately when the ratio log(x/y) is around √loglog x. By modeling characters by random multiplicative functions, we give a sharp bound of 1/r-1∑χ \!\!\! r |∑x<n x+yχ(n)|, where r is a large prime and x+y r. This extends the result of Harper {Harper_charac}.
No takes yet. Share an insight, caveat, or question.
Rachid Caich (2024) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: