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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We study the number of k-element sets Aź {1,...,N} with |A+A| ≤ K|A| for some (fixed) K 0. Improving results of the first author and of Alon, Balogh, Samotij and the second author, we determine this number up to a factor of 2o(k)No(1) for most N and k. As a consequence of this and a further new result concerning the number of sets Aźź/Nź with |A+A| ≤ c|A|2, we deduce that the random Cayley graph on ź/Nź with edge density ½ has no clique or independent set of size greater than (2+o(1)) log2N, asymptotically the same as for the Erdźs-Rényi random graph. This improves a result of the first author from 2003 in which a bound of 160log2N was obtained. As a second application, we show that if the elements of A ź ź are chosen at random, each with probability 1/2, then the probability that A+A misses exactly k elements of ź is equal to (2+O(1))źk/2 as k ź ź.

Counting sets with small sumset and applications