The Growth Rate of Tri-Colored Sum-Free Sets
Combinatorics
2018-07-09 v3
Abstract
Let be an abelian group. A tri-colored sum-free set in is a collection of triples in such that if and only if . Fix a prime and let be the cyclic group of order . Let . 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 has size at most . Between this paper and a paper of Pebody, we will show that, for any , and sufficiently large, there are tri-colored sum-free sets in of size . Our construction also works when is not prime.
Keywords
Cite
@article{arxiv.1607.00047,
title = {The Growth Rate of Tri-Colored Sum-Free Sets},
author = {Robert Kleinberg and Will Sawin and David E. Speyer},
journal= {arXiv preprint arXiv:1607.00047},
year = {2018}
}
Comments
10 pages, published in Discrete Analysis