Upper and Lower Bounds on Zero-Sum Generalized Schur Numbers
Abstract
Let Sz(k,r) be the least positive integer such that for any r-coloring : \1,2,…,Sz(k,r)\ \1, 2, …, r\, there is a sequence x1, x2, …, xk such that Σi=1k-1 xi = xk, and Σi=1k (xi) 0 r. We show that when k is greater than r, kr - r - 1 Sz(k,r) kr - 1, and when r is an odd prime, Sz(k,r) is in fact equal to kr - r.
0
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.