Erdos-Ginzburg-Ziv type generalizations for linear equations and linear inequalities in three variables
Abstract
For any linear inequality in three variables L, we determine (if it exist) the smallest integer R(L, Z/3Z) such that: for every mapping :[1,n] \0,1,2\, with n≥ R(L, Z/3Z), there is a solution (x1,x2,x3)∈ [1,n]3 of L with (x1)+(x2)+(x3) 0 (mod 3). Moreover, we prove that R(L, Z/3Z)=R(L, 2), where R(L, 2) denotes the classical 2-color Rado number, that is, the smallest integer (provided it exist) such that for every 2-coloring of [1,n], with n≥ R(L, 2), there exist a monochromatic solution of L. Thus, we get an Erdos-Ginzburg-Ziv type generalization for all lineal inequalities in three variables having a solution in the positive integers. We also show a number of families of linear equations in three variables L such that they do not admit such Erdos-Ginzburg-Ziv type generalization, named R(L, Z/3Z)≠ R(L, 2). At the end of this paper some questions are proposed.
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.