By the 1970s, mathematicians had figured out that embedded within the structure of Cayley graphs is information about the Fourier series from Chowla’s problem. Using a completely different set of techniques, Benjamin Bedert inched even closer to resolving Chowla’s cosine problem. Eventually, you’ll get so many cliques that you’ll have generated more edges than the Cayley graph can hold. But their headline result was about Chowla’s cosine problem. Now, Jin hopes that the specific connection between Chowla’s cosine problem and MaxCut hints at something broader.