On minimal colorings without monochromatic solutions to a linear equation
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 Σi=0n-2 qixi = qn-1xn-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 x1+x2+x3=4x4. These results lead to several open problems and conjectures on minimal colorings.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.