Networks Hold the Key to a Decades-Old Problem

[mklabgr]

The article describes a major advance on a decades-old problem in Fourier analysis known as Chowla’s cosine problem. Fourier analysis studies how complicated functions can be represented as combinations of simple waves, and Chowla asked how low a sum of $N$ cosine waves must become. He conjectured that for any set of $N$ positive integers, a corresponding cosine sum must eventually fall below $-\sqrt{N}$. Despite decades of work, mathematicians had been unable to approach this bound; the best previous result was dramatically weaker.

The breakthrough came unexpectedly from graph theory rather than traditional Fourier analysis. Researchers studied eigenvalues of special networks called Cayley graphs and realized that the graph structure could be translated into information about cosine sums. Their method proved that every such cosine sum falls below $-N^{1/10}$, while a subsequent result improved this to $-N^{1/7}$.

 These results still do not prove Chowla’s conjectured $-N^{1/2}$ bound, but they are the first advances to have the same power-law form as the conjecture. The deeper significance is the unexpected connection between graph theory and Fourier analysis, suggesting that techniques developed for networks may reveal new structure in problems about waves and number theory.


ARTICLE