On the minimum number of monochromatic generalized Schur triples

zbMATH Open1361.05134arXiv1609.07639MaRDI QIDQ529002FDOQ529002

Authors: Elaine Wong, Thotsaporn Thanatipanonda 

Publication date: 18 May 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: The solution to the problem of finding the minimum number of monochromatic triples $(x,y,x+ay)$ with $ageq2$ being a fixed positive integer over any 2-coloring of $[1,n]$ was conjectured by Butler, Costello, and Graham (2010) and Thanathipanonda (2009). We solve this problem using a method based on Datskovsky's proof (2003) on the minimum number of monochromatic Schur triples $(x,y,x+y)$. We do this by exploiting the combinatorial nature of the original proof and adapting it to the general problem.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• The number of monochromatic Schur triples
• Exact Lower Bounds for Monochromatic Schur Triples and Generalizations
• On the monochromatic Schur triples type problem
• On the number of monochromatic Schur triples.
• The minimal number of monochromatic Schur tuples in a cyclic group
• Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers
• scientific article; zbMATH DE number 637325
• On Generalized Schur Numbers
• scientific article; zbMATH DE number 3294609
• A general lower bound on the weak Schur number

zbMATH Keywords

optimizationSchur triplesRado equationRamsey theory on integers

Mathematics Subject Classification ID

Ramsey theory (05D10)

Cites Work

• A 2-coloring of \([1, N]\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less
• On Sets of Acquaintances and Strangers at any Party
• On Schur properties of random subsets of integers
• On the number of monochromatic Schur triples.
• The number of monochromatic Schur triples
• Title not available (Why is that?)
• On the monochromatic Schur triples type problem
• Finding Patterns Avoiding Many Monochromatic Constellations

Cited In (8)

• The minimal number of monochromatic Schur tuples in a cyclic group
• On the monochromatic Schur triples type problem
• The number of monochromatic Schur triples
• On the asymptotic minimum number of monochromatic 3-term arithmetic progressions
• Exact Lower Bounds for Monochromatic Schur Triples and Generalizations
• Multiplicity of monochromatic solutions to \(x+y<z\)
• Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers
• On the minimum number of monochromatic 2-dimensional Schur triples

Uses Software

• RON

This page was built for publication: On the minimum number of monochromatic generalized Schur triples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q529002)