The minimum number of monochromatic 4-term progressions in \(\mathbb Z_p\)
From MaRDI portal
Publication:989229
DOI10.4310/JOC.2010.v1.n1.a4zbMath1227.11037OpenAlexW2316051135MaRDI QIDQ989229
Publication date: 30 August 2010
Published in: Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4310/joc.2010.v1.n1.a4
Other combinatorial number theory (11B75) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10) Arithmetic progressions (11B25)
Related Items
On some problems of Euclidean Ramsey theory ⋮ On tripartite common graphs ⋮ Inducibility and universality for trees ⋮ Large values of the Gowers-Host-Kra seminorms ⋮ Counting patterns in colored orthogonal arrays ⋮ Monochromatic 4-term arithmetic progressions in 2-colorings of \(\mathbb Z_n\) ⋮ Linear configurations containing 4-term arithmetic progressions are uncommon ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ A uniform set with fewer than expected arithmetic progressions of length 4 ⋮ A note on the inducibility of 4-vertex graphs ⋮ Using Ramsey theory to measure unavoidable spurious correlations in big data ⋮ Unnamed Item
