A lower bound for the k-multicolored sum-free problem in Znm

Abstract

In this paper, we give a lower bound for the maximum size of a k-colored sum-free set in Zmn, where k≥ 3 and m≥ 2 are fixed and n tends to infinity. If m is a prime power, this lower bound matches (up to lower order terms) the previously known upper bound for the maximum size of a k-colored sum-free set in Zmn. This generalizes a result of Kleinberg-Sawin-Speyer for the case k=3 and as part of our proof we also generalize a result by Pebody that was used in the work of Kleinberg-Sawin-Speyer. Both of these generalizations require several key new ideas.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…