A Log-Free $n^{1/5}$ Bound for Chowla's Cosine Problem

Source abstract

For a finite set $S$ of positive integers, put $K(S):=-\min_{x\in\mathbb T}\sum_{s\in S}\cos(2πsx)$. Bedert recently proved the uniform lower bound $K(S)\geq |S|^{1/5-o(1)}$. We remove the subpolynomial loss and prove that $K(S)\geq c|S|^{1/5}$ for an absolute constant $c>0$. The proof combines two estimates from Bedert's argument with an exact averaging identity for the asymmetric boundaries of additive intersections. This identity replaces the multiplicative-amplification step responsible for the logarithmic loss.