The minimum number of monochromatic 4-term progressions in Z_p
From MaRDI portal
Publication:989229
DOI10.4310/JOC.2010.V1.N1.A4zbMATH Open1227.11037OpenAlexW2316051135MaRDI QIDQ989229FDOQ989229
Authors: Julia Wolf 
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
Recommendations
Coloring of graphs and hypergraphs (05C15) Other combinatorial number theory (11B75) Ramsey theory (05D10) Arithmetic progressions (11B25)
Cited In (16)
- Counting patterns in colored orthogonal arrays
- Monochromatic 4-term arithmetic progressions in 2-colorings of \(\mathbb Z_n\)
- Monochromatic progressions in random colorings
- A uniform set with fewer than expected arithmetic progressions of length 4
- On some problems of Euclidean Ramsey theory
- From discrete to continuous: monochromatic 3-term arithmetic progressions
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- On tripartite common graphs
- Using Ramsey theory to measure unavoidable spurious correlations in big data
- Title not available (Why is that?)
- Large values of the Gowers-Host-Kra seminorms
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- On uncommon systems of equations
- A note on the inducibility of 4-vertex graphs
- Inducibility and universality for trees
- Linear configurations containing 4-term arithmetic progressions are uncommon
This page was built for publication: The minimum number of monochromatic 4-term progressions in \(\mathbb Z_p\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989229)
