The Growth Rate of Tri-Colored Sum-Free Sets

Abstract

Let G be an abelian group. A tri-colored sum-free set in Gn is a collection of triples ( ai, bi, ci) in Gn such that ai+ bj+ ck=0 if and only if i=j=k. Fix a prime q and let Cq be the cyclic group of order q. Let θ = >0 (1++·s + q-1) -(q-1)/3. Blasiak, Church, Cohn, Grochow, Naslund, Sawin, and Umans (building on previous work of Croot, Lev and Pach, and of Ellenberg and Gijswijt) showed that a tri-colored sum-free set in Cqn has size at most 3 θn. Between this paper and a paper of Pebody, we will show that, for any δ > 0, and n sufficiently large, there are tri-colored sum-free sets in Cqn of size (θ-δ)n. Our construction also works when q is not prime.

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…