Monochromatic 4-term arithmetic progressions in 2-colorings of \(\mathbb Z_n\)

DOI10.1016/J.JCTA.2011.12.004zbMath1293.05385arXiv1107.2888OpenAlexW2147906032MaRDI QIDQ412187

Linyuan Lu, Xing Peng

Publication date: 4 May 2012

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.2888

zbMATH Keywords

2-colorings of \([n\)]2-colorings of \(\mathbb Z_n\)2-colorings of \(\mathbb Z_p\)monochromatic arithmetic progressions

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Ramsey theory (05D10) Arithmetic progressions (11B25)

Related Items (3)

Counting patterns in colored orthogonal arrays ⋮ Linear configurations containing 4-term arithmetic progressions are uncommon ⋮ Using Ramsey theory to measure unavoidable spurious correlations in big data

Uses Software

• RON

Cites Work

• The minimum number of monochromatic 4-term progressions in \(\mathbb Z_p\)
• On monochromatic solutions of equations in groups
• On the monochromatic Schur triples type problem
• Quantitative theorems for regular systems of equations
• A 2-coloring of \([1, N\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less]
• On the number of monochromatic Schur triples.
• The number of monochromatic Schur triples
• On the asymptotic minimum number of monochromatic 3-term arithmetic progressions
• Finding Patterns Avoiding Many Monochromatic Constellations

This page was built for publication: Monochromatic 4-term arithmetic progressions in 2-colorings of \(\mathbb Z_n\)