A Half-Constant Upper Bound for Chowla's Cosine Problem
Abstract
Let lambda(n) denote the infimum of -min_x sum_{a in A} cos(ax) over all sets A of n positive integers. While the classical Sidon-difference construction yields lambda(n) <= (1 + o(1))sqrt(n)/2, we construct sets achieving a leading constant of 1/2: lambda(n) <= (1/2)sqrt(n) + O(n^(1/4)sqrt(log n)), establishing limsup_{n->infinity} lambda(n)/sqrt(n) <= 1/2. This construction combines a two-sided Sidon square identity, a Singer difference set, a Fejer-kernel majorant, a parity-biased deletion, and an exact-cardinality probabilistic selection. We also provide an L^4 criterion and a multiplicity bound constraining any construction with a smaller leading constant. In the opposite direction, we incorporate the L^1 norm into Bedert's boundary estimate with an explicit constant, yielding two lower bounds for f_A(x) = sum_{a in A} cos(ax): (1) -min f_A >= cn^(1/4) for every n-element set A subset of [1, Cn]; and (2) (-min f_A)^3 ||f_A||_1^2 >= cn for every n-element set A subset of N. The second bound recovers the 1/5 exponent of Bedert and Shankar and improves it whenever ||f_A||_1 is small relative to -min f_A. Numerical values of the construction are reported up to |A| = 25,440.
Related
- A Log-Free n1/5 Bound for Chowla's Cosine Problem
- Lower bounds for the magnitude of the minimum eigenvalue of graphs with applications to MaxCut and Chowla's cosine problem
- A computer-assisted upper bound of 1.7813 for the real Grothendieck constant
- Disproof of a Conjectured Upper Bound for the Davenport Constant
- An upper bound for the three-dimensional moving sofa problem in a snaky corridor
BibTeX
@misc{bu2026halfconstant,
title = {{A Half-Constant Upper Bound for Chowla's Cosine Problem}},
author = {Bryan Bu and Fayzan Khan and Hyunjun Yi and Atharv Jha and Ishaan Chandupatla and Madhav Nagpal},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.17160},
eprint = {2610.17160},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.17160},
}
RIS
TY - UNPB
TI - A Half-Constant Upper Bound for Chowla's Cosine Problem
AU - Bryan Bu
AU - Fayzan Khan
AU - Hyunjun Yi
AU - Atharv Jha
AU - Ishaan Chandupatla
AU - Madhav Nagpal
PY - 2026
DA - 2026/10/28
PB - arXiv
DO - 10.48550/arxiv.2610.17160
UR - https://arxiv.org/abs/2610.17160
AB - Let lambda(n) denote the infimum of -min_x sum_{a in A} cos(ax) over all sets A of n positive integers. While the classical Sidon-difference construction yields lambda(n) <= (1 + o(1))sqrt(n)/2, we construct sets achieving a leading constant of 1/2: lambda(n) <= (1/2)sqrt(n) + O(n^(1/4)sqrt(log n)), establishing limsup_{n->infinity} lambda(n)/sqrt(n) <= 1/2. This construction combines a two-sided Sidon square identity, a Singer difference set, a Fejer-kernel majorant, a parity-biased deletion, and an exact-cardinality probabilistic selection. We also provide an L^4 criterion and a multiplicity bound constraining any construction with a smaller leading constant. In the opposite direction, we incorporate the L^1 norm into Bedert's boundary estimate with an explicit constant, yielding two lower bounds for f_A(x) = sum_{a in A} cos(ax): (1) -min f_A >= cn^(1/4) for every n-element set A subset of [1, Cn]; and (2) (-min f_A)^3 ||f_A||_1^2 >= cn for every n-element set A subset of N. The second bound recovers the 1/5 exponent of Bedert and Shankar and improves it whenever ||f_A||_1 is small relative to -min f_A. Numerical values of the construction are reported up to |A| = 25,440.
ER -