Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Growth Rate of Tri-Colored Sum-Free Sets (1607.00047v3)

Published 30 Jun 2016 in math.CO

Abstract: Let $G$ be an abelian group. A tri-colored sum-free set in $Gn$ is a collection of triples $({\bf a}i, {\bf b}_i, {\bf c}_i)$ in $Gn$ such that ${\bf a}_i+{\bf b}_j+{\bf c}_k=0$ if and only if $i=j=k$. Fix a prime $q$ and let $C_q$ be the cyclic group of order $q$. Let $\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 $C_qn$ has size at most $3 \thetan$. Between this paper and a paper of Pebody, we will show that, for any $\delta > 0$, and $n$ sufficiently large, there are tri-colored sum-free sets in $C_qn$ of size $(\theta-\delta)n$. Our construction also works when $q$ is not prime.

Summary

We haven't generated a summary for this paper yet.