Chowla’s square-root conjecture for cosine sums

Establish that the extremal quantity \(\mathcal K(N)=\inf_{S\subset\mathbb N,\,|S|=N}K(S)\), where \(K(S)=-\min_{x\in\mathbb R/\mathbb Z}\sum_{s\in S}\cos(2\pi sx)\), has optimal order of magnitude \(\sqrt N\); equivalently, prove the lower bound \(\mathcal K(N)\gg \sqrt N\).

Background

Chowla’s cosine problem concerns the smallest possible negative minimum of a cosine sum associated with an NN-element set of positive integers. The paper proves the polynomial lower bound K(N)≫N1/5\mathcal K(N)\gg N^{1/5}, improving the previously known N1/5−o(1)N^{1/5-o(1)} estimate by removing a logarithmic loss.

The paper notes that a Sidon-difference construction gives the matching-order upper bound K(N)≪N\mathcal K(N)\ll\sqrt N. Thus the unresolved issue is to improve the lower bound from exponent $1/5$ to the conjectured exponent $1/2$, which would determine the optimal order of magnitude.

References

Chowla later conjectured that the optimal order of magnitude is \sqrt N pp.~128, 130.

— A Log-Free $n^{1/5}$ Bound for Chowla's Cosine Problem  (2609.05338 - Shankar, 4 Sep 2026) in Section 1, Introduction

Another notable problem under this theme of investigating analytical properties of Fourier transforms of indicator functions is one of Chowla. This problem, stated as Problem~\ref{chowla problem} below, has come to be known as Chowla's cosine problem and culminates in Conjecture~\ref{chowla}, which remains open.

— Lower bounds for the magnitude of the minimum eigenvalue of graphs with applications to MaxCut and Chowla's cosine problem  (2610.01657 - Yip, 1 Oct 2026) in Section 1, subsection “Chowla's cosine problem”; Problem 1 and Conjecture 1