Abstract
Let V ( n ) be the minimum number of monochromatic 3-term arithmetic progressions in any 2-coloring of { 1 , 2 , … , n } . We show that 1675 32 768 n 2 ( 1 + o ( 1 ) ) ⩽ V ( n ) ⩽ 117 2192 n 2 ( 1 + o ( 1 ) ) . As a consequence, we find that V ( n ) is strictly greater than the corresponding number for Schur triples (which is 1 22 n 2 ( 1 + o ( 1 ) ) ). Additionally, we disprove the conjecture that V ( n ) = 1 16 n 2 ( 1 + o ( 1 ) ) as well as a more general conjecture.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
