Hostname: page-component-5b777bbd6c-rbv74 Total loading time: 0 Render date: 2025-06-18T17:54:22.672Z Has data issue: false hasContentIssue false

Uniform sets with few progressions via colourings

Published online by Cambridge University Press:  15 May 2025

MINGYANG DENG
Affiliation:
Computer Science & Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, U.S.A. e-mail: dengm@mit.edu
JONATHAN TIDOR
Affiliation:
Department of Mathematics, Stanford University, 450 Jane Stanford Way, Stanford, CA 94305, U.S.A. e-mail: jtidor@stanford.edu
YUFEI ZHAO
Affiliation:
Department of Mathematics, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, U.S.A. e-mail: yufeiz@mit.edu

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.

Type
Research Article
Copyright
© The Author(s), 2025. Published by Cambridge University Press on behalf of Cambridge Philosophical Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

Supported by a Stanford Science Fellowship.

Supported by NSF CAREER Award DMS- 2044606 and a Sloan Research Fellowship.

References

Behrend, F. A.. On sets of integers which contain no three terms in arithmetical progression. Proc. Nat. Acad. Sci. U.S.A. 32 (1946), 331–332.Google Scholar
Bergelson, V., Host, B., and Kra, B.. Multiple recurrence and nilsequences. Invent. Math. 160 (2005), 261–303, With an appendix by Imre Ruzsa.Google Scholar
Croot, E. S., III and Lev, V. F.. Open problems in additive combinatorics. Additive combinatorics, CRM Proc. Lecture Notes, vol. 43 (Amer. Math. Soc., Providence, RI, 2007), pp. 207–233.CrossRefGoogle Scholar
Gowers, W. T.. A uniform set with fewer than expected arithmetic progressions of length 4. Acta Math. Hungar. 161 (2020), 756–767.Google Scholar
T. Gowers, W.. A new proof of Szemerédi’s theorem. Geom. Funct. Anal. 11 (2001), 465588.CrossRefGoogle Scholar
Green, B. and Tao, T.. New bounds for Szemerédi’s theorem, III: a polylogarithmic bound for $r_4(N)$ . Mathematika 63 (2017), 9441040.CrossRefGoogle Scholar
Leng, J., Sah, A., and Sawhney, M.. Improved bounds for Szemerédi’s theorem. arXiv: 2402.17995.Google Scholar
Roth, K. F.. On certain sets of integers. J. London Math. Soc. 28 (1953), 104109.CrossRefGoogle Scholar
Ruzsa, I. Z.. Solving a linear equation in a set of integers. I. Acta Arith. 65 (1993), 259–282.Google Scholar
Wolf, J.. The minimum number of monochromatic 4-term progressions in $\mathbb Z_p$ . J. Comb. 1 (2010), 5368.Google Scholar