Balanced subset sums of dense sets of integers
Given n different positive integers not greater than 2n-2, we prove that more than n^2/12 consecutive integers can be represented as the sum of half of the given numbers. This confirms a conjecture of Lev.
|Keywords||subset sum problem|
|MSC||Other combinatorial number theory (msc 11B75)|
|THEME||Logistics (theme 3)|
|Series||CWI. Probability, Networks and Algorithms [PNA]|
|Note||This work was carried out under project PNA1-Spinoza Award|
Karolyi, G. (2008). Balanced subset sums of dense sets of integers. CWI. Probability, Networks and Algorithms [PNA]. CWI.