On minimal colorings without monochromatic solutions to a linear equation

MaRDI QIDQ5754476zbMATH OpenFDO

Authors Boris Alexeev, Jacob Fox, Ron Graham

Publication date 22 August 2007

Full work available at URL https://arxiv.org/abs/1009.4234, http://www.integers-ejcnt.org/vol7-2.html

zbMATH Keywords

partition regularityRado's theorem

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Ramsey theory (05D10)

Abstract: For a ring R and system L of linear homogeneous equations, we call a coloring of the nonzero elements of R minimal for L if there are no monochromatic solutions to L and the coloring uses as few colors as possible. For a rational number q and positive integer n, let E(q,n) denote the equation $su{m}_{i=0}^{n-2}{q}^i{x}_i=q^{n-1}{x}_{n-1}$. We classify the minimal colorings of the nonzero rational numbers for each of the equations E(q,3) with q in {3/2,2,3,4}, for E(2,n) with n in {3,4,5,6}, and for x_1+x_2+x_3=4x_4. These results lead to several open problems and conjectures on minimal colorings.

Recommendations

• On the degree of regularity of some equations
• Two-color Rado numbers for the equations \(2x_1 + 2x_2 + c = x_3\) and \(2x_1 +2x_2 + 2x_3 + c = x_4\)
• Rainbow solutions of linear equations over \(\mathbb Z_p\)
• All two-color Rado numbers for \(a(x+y)=bz\)
• Rainbow-free colorings for x+y=cz in Z_p

Cited in

(7)

• Regularity of certain Diophantine equations
• Resolving a conjecture on degree of regularity of linear homogeneous equations
• Introducing shift-constrained Rado numbers
• An infinite color analogue of Rado's theorem
• Monochromatic sum and product in \(\mathbb{Z} / m \mathbb{Z}\)
• Monotonic stable solutions for minimum coloring games
• Equations resolving a conjecture of Rado on partition regularity

This page was built for publication: On minimal colorings without monochromatic solutions to a linear equation

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