A 2-coloring of [1, N] can have (1/22) N^2+O(N) monochromatic Schur triples, but not less

MaRDI QIDQ1383294zbMATH OpenFDO

Authors Aaron Robertson, Doron Zeilberger

Publication date 14 April 1998

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

Full work available at URL https://arxiv.org/abs/math/9803149, http://www.emis.de/journals/EJC/Volume_5/Abstracts/v5i1r19.html

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

zbMATH Keywords

coloringsSchur triple

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Asymptotic enumeration (05A16) Ramsey theory (05D10)

Abstract: We prove that the minimum number (asymptotically) of monochromatic Schur triples that a 2-coloring of [1,n] can have is (n^2)/22 + O(n). This was solved independently by Tomasz Schoen.

Review text

The authors solve the following problem posed by Ron Graham: Find (asymptotically) the least number of monochromatic Schur triples \(\{i,j,i+j\}\) that may occur in a 2-coloring of the integers \(1,2,\dots, n\). First the problem is recast as a minimization problem over the discrete \(n\)-cube. The non-positivity of certain discrete partial derivatives forces local minima to satisfy a ``ping-pong recurrence which the authors solved explicitly using Maple to obtain the result of the title. The methods extend to give an upper bound for the minimum number of monochromatic triples for \(r\)-colorings. Note: As acknowledged by the authors, this problem has been solved independently by \textit{Tomasz Schoen} [On the number of monochromatic Schur triples (in preparation)].

Recommendations

• On the monochromatic Schur triples type problem
• The number of monochromatic Schur triples
• On the number of monochromatic Schur triples.
• On the minimum number of monochromatic generalized Schur triples
• A multiplicity problem related to Schur numbers

Cited in

(31)

• 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
• Multiplicity of monochromatic solutions to \(x+y<z\)
• The number of monochromatic Schur triples
• RON
• On the asymptotic minimum number of monochromatic 3-term arithmetic progressions
• On Rado numbers for \(\Sigma^{m-1}_{i=1} a_{i}x_{i}= x_{m}\)
• Disjunctive Rado numbers
• Exact Lower Bounds for Monochromatic Schur Triples and Generalizations
• Some Ramsey and anti–Ramsey results in finite groups
• A multiplicity problem related to Schur numbers
• Counting patterns in colored orthogonal arrays
• Monochromatic 4-term arithmetic progressions in 2-colorings of Z_n
• Two formulas of 2-color off-diagonal Rado numbers
• On colorings of Pythagorean triples within colorings of the positive integers
• On the minimum number of monochromatic generalized Schur triples
• A Schur-type addition theorem for primes
• On the minimum number of monochromatic 2-dimensional Schur triples
• From discrete to continuous: monochromatic 3-term arithmetic progressions
• On uncommon systems of equations
• An unsure note on an un-Schur problem
• The Rado multiplicity problem in vector spaces over finite fields
• New Ramsey multiplicity bounds and search heuristics
• On monochromatic solutions of linear equations using at least three colors
• Optimization tools for computing colorings of \([1, \dots, n]\) with few monochromatic solutions on 3-variable linear equations
• Polynomial Schur's theorem
• On product Schur triples in the integers
• The Rado multiplicity problem in vector spaces over finite fields (extended abstract)
• Hook-free colorings and a problem of Hanson
• On monochromatic solutions of equations in groups

This page was built for publication: A 2-coloring of \([1, N]\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less

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