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

Let $A \subset \mathbb{Z}_{>0}$ of size $n$. It is conjectured that for any$C >0$ and $n$ large enough that $A$ contains a sum-free subset of size atleast $n/3 +C$. We study this problem and find an alternate proof of Bourgain'sresult that one make take $C=2/3$.

On the largest sum-free subset problem in the integers