paper

Uniform sets with few progressions via colorings

arXiv:2307.06914 · doi:10.1017/S0305004125000106

Abstract

Ruzsa asked whether there exist Fourier-uniform subsets of with density and 4-term arithmetic progression (4-AP) density at most , for arbitrarily large . Gowers constructed Fourier uniform sets with density and 4-AP density at most for some small constant . We show that an affirmative answer to Ruzsa's question would follow from the existence of an -coloring of without symmetrically colored 4-APs. For a broad and natural class of constructions of Fourier-uniform subsets of , 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 , we show that there exist -uniform subsets of with density and -AP density at most . We also prove generalizations to arbitrary one-dimensional patterns.

20 pages; typos corrected

Uniform sets with few progressions via colorings · wovepaper