Abstract
We say a pair of integers (a, b) is findable if the following is true. For any δ > 0 there exists a p0 such that for any prime p ≥ p0 and any red-blue colouring of ℤ/pℤ in which each colour has density at least δ, we can find an arithmetic progression of length a + b inside ℤ/pℤ whose first a elements are red and whose last b elements are blue.
Szemeredi’s Theorem on arithmetic progressions implies that (0, k) and (1, k) are find-able for any k. We prove that (2, k) is also findable for any k. However, the same is not true of (3, k). Indeed, we give a construction showing that (3,30000) is not findable. We also show that (14, 14) is not findable.
Similar content being viewed by others
References
N. Alon, J. Fox and Y. Zhao: Efficient arithmetic regularity and removal lemmas for induced bipartite patterns, Discrete Analysis 3, 2019.
V. Bergelson and A. Leibman: Polynomial extensions of van der Waerden’s and Szemeredi’s theorems, J. Amer. Math. Soc. 9 (1996), 725–753.
J. Cassaigne, J. D. Currie, L. Schaeffer and J. Shallit: Avoiding three consecutive blocks of the same size and same sum, J. ACM 61 (2014), Art. 10, 17.
F. M. Dekking: Strongly nonrepetitive sequences and progression-free sets, J. Combin. Theory Ser. A 27 (1979), 181–185.
H. Furstenberg and Y. Katznelson: An ergodic Szemerédi theorem for commuting transformations, J. Analyse Math. 34 (1979), 275–291.
E. Szemerédi: On sets of integers containing no k elements in arithmetic progression, Acta Arith. 27 (1975), 199–245. Collection of articles in memory of Juriï Vladimirovic Linnik.
Acknowledgements
I would like to thank Ben Green for some helpful comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Work completed while the author was at the Mathematical Institute, University of Oxford.
Rights and permissions
About this article
Cite this article
Mandache, M. Finding Certain Arithmetic Progressions in 2-Coloured Cyclic Groups. Combinatorica 42 (Suppl 2), 1385–1408 (2022). https://doi.org/10.1007/s00493-022-4901-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-022-4901-x