English

The Growth Rate of Tri-Colored Sum-Free Sets

Combinatorics 2018-07-09 v3

Abstract

Let GG be an abelian group. A tri-colored sum-free set in GnG^n is a collection of triples (ai,bi,ci)({\bf a}_i, {\bf b}_i, {\bf c}_i) in GnG^n such that ai+bj+ck=0{\bf a}_i+{\bf b}_j+{\bf c}_k=0 if and only if i=j=ki=j=k. Fix a prime qq and let CqC_q be the cyclic group of order qq. Let θ=minρ>0(1+ρ++ρq1)ρ(q1)/3\theta = \min_{\rho>0} (1+\rho+\cdots + \rho^{q-1}) \rho^{-(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 CqnC_q^n has size at most 3θn3 \theta^n. Between this paper and a paper of Pebody, we will show that, for any δ>0\delta > 0, and nn sufficiently large, there are tri-colored sum-free sets in CqnC_q^n of size (θδ)n(\theta-\delta)^n. Our construction also works when qq 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