(k+1)-sums versus k-sums

Abstract: A

k

-sum of a set

A s u b s e t e q m a t h b b Z

is an integer that may be expressed as a sum of

k

distinct elements of

A

. How large can the ratio of the number of

(k + 1)

-sums to the number of

k

-sums be? Writing

k w e d g e A

for the set of

k

-sums of

A

we prove that [ frac{|(k+1)wedge A|}{|kwedge A|}, le , frac{|A|-k}{k+1} ] whenever

| A | g e (k^{2} + 7 k) / 2

. The inequality is tight -- the above ratio being attained when

A

is a geometric progression. This answers a question of Ruzsa.

Full work available at URL: https://arxiv.org/abs/1011.4495

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Cited In (5)

   Recommendations

This page was built for publication: \((k+1)\)-sums versus \(k\)-sums