Short-interval variance conjecture for sums of the Möbius function times the number-of-prime-factors function

About 10 years old · traced to

Let μ(n)\mu(n) denote the Möbius function and let ω(n)\omega(n) denote the number of distinct prime factors of nn. For X→∞X\to\infty, let H=XδH=X^\delta with δ∈(0,1)\delta\in(0,1). Short-interval variance conjecture for μω\mu\omega.

1X∫X2X(∑x≤n≤n+Hμ(n)ω(n))2 dx∼H(log⁡log⁡X)2.\frac{1}{X}\int_X^{2X}\Big(\sum_{x\leq n\leq n+H}\mu(n)\omega(n)\Big)^2\,dx\sim H(\log\log X)^2.

The source presents this as an integer analogue of a proved function-field variance formula. It is motivated by the growth Hn∼log⁡nH_n\sim\log n with n=deg⁡(f)n=\deg(f), but its status is not specified.

References

Primary source

Brad Rodgers, “Arithmetic functions in short intervals and the symmetric group”, arXiv:1609.02967 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.