English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A tri-colored sum-free set in an abelian group $H$ is a collection of orderedtriples in $H^3$, $\{(a_i,b_i,c_i)\}_{i=1}^m$, such that the equation$a_i+b_j+c_k=0$ holds if and only if $i=j=k$. Using a variant of the lemmaintroduced by Croot, Lev, and Pach in their breakthrough work onarithmetic-progression-free sets, we prove that the size of any tri-coloredsum-free set in $\mathbb{F}_2^n$ is bounded above by $6 {n \choose \lfloor n/3\rfloor}$. This upper bound is tight, up to a factor subexponential in $n$:there exist tri-colored sum-free sets in $\mathbb{F}_2^n$ of size greater than${n \choose \lfloor n/3 \rfloor} \cdot 2^{-\sqrt{16 n / 3}}$ for allsufficiently large $n$.

A nearly tight upper bound on tri-colored sum-free sets in characteristic 2