A quadratic lower bound for subset sums

Details A quadratic lower bound for subset sums A quadratic lower bound for subset sums

2006-12-02

arxiv.org/abs/math/0612045v2

Mathematics

Number Theory

12 pages

Scientific paper

Let A be a finite nonempty subset of an additive abelian group G, and let \Sigma(A) denote the set of all group elements representable as a sum of some subset of A. We prove that |\Sigma(A)| >= |H| + 1/64 |A H|^2 where H is the stabilizer of \Sigma(A). Our result implies that \Sigma(A) = Z/nZ for every set A of units of Z/nZ with |A| >= 8 \sqrt{n}. This consequence was first proved by Erd\H{o}s and Heilbronn for n prime, and by Vu (with a weaker constant) for general n.

Affiliated with

Also associated with

No associations

Rating

A quadratic lower bound for subset sums does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A quadratic lower bound for subset sums, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A quadratic lower bound for subset sums will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-671930