On the size of $k$-fold sum and product sets of integers

Details On the size of $k$-fold sum and product sets of integers On the size of $k$-fold sum and product sets of integers

2003-09-03

arxiv.org/abs/math/0309055v1

Mathematics

Combinatorics

33 pages, no figures, submitted, J. Amer. Math. Soc. (Proxy submission)

Scientific paper

We prove the following theorem: for all positive integers $b$ there exists a positive integer $k$, such that for every finite set $A$ of integers with cardinality $|A| > 1$, we have either $$ |A + ... + A| \geq |A|^b$$ or $$ |A \cdot ... \cdot A| \geq |A|^b$$ where $A + ... + A$ and $A \cdot ... \cdot A$ are the collections of $k$-fold sums and products of elements of $A$ respectively. This is progress towards a conjecture of Erd\"os and Szemer\'edi on sum and product sets.

Affiliated with

Also associated with

No associations

Rating

On the size of $k$-fold sum and product sets of integers 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 On the size of $k$-fold sum and product sets of integers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the size of $k$-fold sum and product sets of integers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-302261