Uniform sets with few progressions via colorings
Abstract
Ruzsa asked whether there exist Fourier-uniform subsets of Z/N Z with density α and 4-term arithmetic progression (4-AP) density at most αC, for arbitrarily large C. Gowers constructed Fourier uniform sets with density α and 4-AP density at most α4+c for some small constant c>0. We show that an affirmative answer to Ruzsa's question would follow from the existence of an No(1)-coloring of [N] without symmetrically colored 4-APs. For a broad and natural class of constructions of Fourier-uniform subsets of Z/N Z, we show that Ruzsa's question is equivalent to our arithmetic Ramsey question. We prove analogous results for all even-length APs. For each odd k≥ 5, we show that there exist Uk-2-uniform subsets of Z/N Z with density α and k-AP density at most αck (1/α). We also prove generalizations to arbitrary one-dimensional patterns.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.