English

Uniform sets with few progressions via colorings

Combinatorics 2025-06-23 v2

Abstract

Ruzsa asked whether there exist Fourier-uniform subsets of Z/NZ\mathbb Z/N\mathbb Z with density α\alpha and 4-term arithmetic progression (4-AP) density at most αC\alpha^C, for arbitrarily large CC. Gowers constructed Fourier uniform sets with density α\alpha and 4-AP density at most α4+c\alpha^{4+c} for some small constant c>0c>0. We show that an affirmative answer to Ruzsa's question would follow from the existence of an No(1)N^{o(1)}-coloring of [N][N] without symmetrically colored 4-APs. For a broad and natural class of constructions of Fourier-uniform subsets of Z/NZ\mathbb Z/N\mathbb 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 k5k\geq 5, we show that there exist Uk2U^{k-2}-uniform subsets of Z/NZ\mathbb Z/N\mathbb Z with density α\alpha and kk-AP density at most αcklog(1/α)\alpha^{c_k \log(1/\alpha)}. We also prove generalizations to arbitrary one-dimensional patterns.

Keywords

Cite

@article{arxiv.2307.06914,
  title  = {Uniform sets with few progressions via colorings},
  author = {Mingyang Deng and Jonathan Tidor and Yufei Zhao},
  journal= {arXiv preprint arXiv:2307.06914},
  year   = {2025}
}

Comments

20 pages; typos corrected

R2 v1 2026-06-28T11:29:40.626Z