On the asymptotic minimum number of monochromatic 3-term arithmetic progressions

DOI10.1016/J.JCTA.2007.03.006zbMath1210.05172arXivmath/0609532OpenAlexW1972252408MaRDI QIDQ2469204

Aaron Robertson, Pablo A. Parrilo, Dan Saracino

Publication date: 4 February 2008

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

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

zbMATH Keywords

Ramsey theoryarithmetic progressionsregular equations

Mathematics Subject Classification ID

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

Related Items (4)

Finding Patterns Avoiding Many Monochromatic Constellations ⋮ Monochromatic 4-term arithmetic progressions in 2-colorings of \(\mathbb Z_n\) ⋮ Congruence properties of multiplicative functions on sumsets and monochromatic solutions of linear equations ⋮ Unnamed Item

Uses Software

• SeDuMi
• RON

Cites Work

• On Schur properties of random subsets of integers
• 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
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

This page was built for publication: On the asymptotic minimum number of monochromatic 3-term arithmetic progressions