← All problems

Folklore conjecture on exponential sums with multiplicative coefficients

For every multiplicative function f:N→Cf:\mathbb{N}\to\mathbb{C} satisfying ∣f(n)∣≤1|f(n)|\leq 1, every real number α\alpha, and every rational approximation a/qa/q with (a,q)=1(a,q)=1, q≤xq\leq x, and ∣α−a/q∣≤1/(qx)\left|\alpha-a/q\right|\leq 1/(qx), one has uniformly as x→∞x\to\infty

∣∑n≤xf(n)e(nα)∣≪xlog⁡x+xq,e(t)=e2πit.\left|\sum_{n\leq x} f(n)e(n\alpha)\right|\ll \frac{x}{\log x}+\frac{x}{\sqrt q},\qquad e(t)=e^{2\pi i t}.
References

Progress summary

Refreshed
Open · progress reported

A new preprint claims sharp cancellation constants, but the general conjecture is not independently verified and a small-denominator case remains unresolved.

The folklore conjecture concerns uniform bounds for exponential sums with multiplicative coefficients, including the scale contributed by rational approximations to the frequency. Its classical formulation includes a bound of order x/log⁡x+x/qx/\log x+x/\sqrt q when α\alpha is approximated by a/qa/q.

Known results

  • Montgomery and Vaughan (1977) established the foundational bound and showed that the x/qx/\sqrt q term cannot generally be removed.
  • Later work classifies large sums near major arcs through a primitive Dirichlet character and a real parameter, but does not establish the full folklore conjecture. https://www.dms.umontreal.ca/~andrew/PDF/CircleMethod2020.v11.pdf

October 2026 sharp-constant claim

Haozhe Gou’s preprint reports optimal leading constants 4/64/\sqrt 6 for multiplicative coefficients and 11 for completely multiplicative functions. Related work says the conjectured bound is proved except around q=(log⁡x)2+o(1)q=(\log x)^{2+o(1)}, with the general multiplicative case there still formulated as a conjecture; no independent assessment was found.

Current status (as of October 2026): The classical bounds and several sharpness results are established, while the claimed optimal constants and the remaining small-denominator range are not independently verified.

Sources

Solutions 0

No solutions have been posted yet.