Erd\H{o}s-Ginzburg-Ziv type generalizations for linear equations and linear inequalities in three variables
Mario Huicochea, Amanda Montejano

TL;DR
This paper establishes a connection between Rado numbers and Erdős-Ginzburg-Ziv type results for linear inequalities in three variables, showing that for many such inequalities, the minimal number ensuring certain solutions is equal to the classical 2-color Rado number.
Contribution
It proves that for linear inequalities in three variables, the minimal integer guaranteeing solutions with sum zero mod 3 equals the classical 2-color Rado number, extending Erdős-Ginzburg-Ziv type results.
Findings
R( ext{L}, ext{Z}/3 ext{Z})=R( ext{L}, 2) for many inequalities
Identification of families where such equalities do not hold
Extension of Erdős-Ginzburg-Ziv results to linear inequalities in three variables
Abstract
For any linear inequality in three variables , we determine (if it exist) the smallest integer such that: for every mapping , with , there is a solution of with (mod ). Moreover, we prove that , where denotes the classical -color Rado number, that is, the smallest integer (provided it exist) such that for every -coloring of , with , there exist a monochromatic solution of . Thus, we get an Erd\H{o}s-Ginzburg-Ziv type generalization for all lineal inequalities in three variables having a solution in the positive integers. We also show a number of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Advanced Optimization Algorithms Research · Graph theory and applications
