Károlyi Gyula: On subset sums of dense sets of integers. II

Abstract:
Let A be a set of n integers in the interval [1,k] and denote by s(A) the sum of the elements in A. According to an old conjecture of Lev, if k<2n-c and n is large enough, then every integer in the interval [2k-2n+1,s(A)-2k+2n-1] can be represented as the sum of some elements in A.

In a previous talk I presented the proof of Lev's conjecture with c=5. After recalling the main idea, I will describe how to prove Lev's conjecture with c=2. This bound on k is tight as well as the length of the above interval.

For Zoom access please contact András Biró (biro.andras[a]renyi.hu).