Uniform sets with few progressions via colourings
Abstract Ruzsa asked whether there exist Fourier-uniform subsets of $\mathbb Z/N\mathbb Z$ with density $\alpha$ and 4-term arithmetic progression (4-AP) density at most $\alpha^C$ , for arbitrarily large C . Gowers constructed Fourier uniform sets with density $\alpha$ and 4-AP density at most $\alpha^{4+c}$ for some small constant $c \gt 0$ . We show that an affirmative answer to Ruzsa’s question would follow from the existence of an $N^{o(1)}$ -colouring of [ N ] without symmetrically coloured 4-APs. For a broad and natural class of constructions of Fourier-uniform subsets of $\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 $k\geq 5$ , we show that there exist $U^{k-2}$ -uniform subsets of $\mathbb Z/N\mathbb Z$ with density $\alpha$ and k -AP density at most $\alpha^{c_k \log(1/\alpha)}$ . We also prove generalisations to arbitrary one-dimensional patterns.
Authors
- Yufei Zhao (ORCID: https://orcid.org/0000-0002-1995-3755)
- Jonathan Tidor (ORCID: https://orcid.org/0000-0001-6371-0657)
- Mingyang Deng
Institutions
- Massachusetts Institute of Technology (US)
- Stanford University (US)
Publication Details
- Journal
- Mathematical Proceedings of the Cambridge Philosophical Society
- Published
- 2025-05-15
- DOI
- https://doi.org/10.1017/s0305004125000106
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00