Polynomial bounds for the Chowla Cosine Problem
Abstract
Let A⊂ N be a finite set of n=|A| positive integers, and consider the cosine sum fA(x)=Σa∈ A ax. We prove that x fA(x)≤slant -n 1/7-o(1), thereby establishing polynomial bounds for the Chowla cosine problem.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.