New bounds for exponential sums with multiplicative coefficients

Researchers establish optimal constants for exponential sums involving multiplicative functions and rational approximations.

The research examines exponential sums where f:N→{z∈C:∣z∣≤1}f: \mathbb{N} \to \{z \in \mathbb{C} : |z| \leq 1\} is multiplicative. It considers cases where α\alpha has a rational approximation a/qa/q such that ∣α−a/q∣≤1/(qx)|\alpha - a/q| \leq 1/(qx) and q≤x/((log⁡x)2(log⁡log⁡x)3)q \leq x/((\log x)^2(\log\log x)^3).

The study proves that ∣∑n≤xf(n)e(nα)∣≤(46+o(1))xq+O(xlog⁡x)\left|\sum_{n \leq x} f(n)e(n\alpha)\right| \leq \left(\frac{4}{\sqrt{6}} + o(1)\right) \frac{x}{\sqrt{q}} + O\left(\frac{x}{\log x}\right). When complete multiplicativity is present, the constant 4/64/\sqrt{6} improves to 11.

Both constants are optimal. This result confirms a folklore conjecture on exponential sums with multiplicative coefficients that was motivated by the work of Montgomery and Vaughan (1977).

The work also provides logarithmically weighted estimates. Additionally, the researchers provide counterexamples to related conjectures.

Key facts

  • The constant 4/64/\sqrt{6} is optimal for the proven bound.
  • Complete multiplicativity improves the constant to 11.
  • The findings confirm a folklore conjecture motivated by Montgomery and Vaughan (1977).

All sections

Edition