k-fold sums from a set with few products

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

19 pages. Final draft -- light corrections, submitted to Siam J. of Discrete Math

Scientific paper

In the present paper we show that if A is a set of n real numbers, and the product set A.A has at most n^(1+c) elements, then the k-fold sumset kA has at least n^(log(k/2)/2 log 2 + 1/2 - f_k(c)) elements, where f_k(c) -> 0 as c -> 0. We believe that the methods in this paper might lead to a much stronger result; indeed, using a result of Trevor Wooley on Vinogradov's Mean Value Theorem and the Tarry-Escott Problem, we show that if |A.A| < n^(1+c), then |k(A.A)| > n^(Omega((k/log k)^(1/3))), for c small enough in terms of k (we believe that a certain modification of this argument can perhaps produce similar conclusions for kA).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

k-fold sums from a set with few products 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 k-fold sums from a set with few products, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and k-fold sums from a set with few products will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-123278

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.