The Growth Rate of Tri-Colored Sum-Free Sets
arXiv:1607.00047 · doi:10.19086/da.3734
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.
10 pages, published in Discrete Analysis
References in corpus (7)
- A Szemeredi-type regularity lemma in abelian groups, with applications
- Progression-free sets in Z_4^n are exponentially small
- On cap sets and the group-theoretic approach to matrix multiplication
- A distribution on triples with maximum entropy marginal
- On large subsets of with no three-term arithmetic progression
- Proof of a Conjecture of Kleinberg-Sawin-Speyer
- Combinatorial results implied by many zero divisors in a group ring
Cited by in corpus (9)
- On cap sets and the group-theoretic approach to matrix multiplication
- A distribution on triples with maximum entropy marginal
- Proof of a Conjecture of Kleinberg-Sawin-Speyer
- Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond
- The G-stable rank for tensors
- Universal points in the asymptotic spectrum of tensors
- Limits on the Universal Method for Matrix Multiplication
- A new upper bound for the size of a sunflower-free family
- Larger Corner-Free Sets from Combinatorial Degenerations