Abstract

We investigate when the better than square-root cancellation phenomenon exists for ∑ n ≤ N a ( n ) f ( n ) \sum _{n\le N}a(n)f(n) , where a ( n ) ∈ C a(n)\in \mathbb {C} and f ( n ) f(n) is a random multiplicative function. We focus on the case where a ( n ) a(n) is the indicator function of R R rough numbers. We prove that log ⁡ log ⁡ R ≍ ( log ⁡ log ⁡ x ) 1 2 \log \log R \asymp (\log \log x)^{\frac {1}{2}} is the threshold for the better than square-root cancellation phenomenon to disappear.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.