English

The Erd\H{o}s-Szemer\'edi problem on sum set and product set

Combinatorics 2007-05-23 v1

Abstract

The basic theme of this paper is the fact that if AA is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erd\H os-Szemer\'edi [E-S]. (see also [El], [T], and [K-T] for related aspects.) Only much weaker results or very special cases of this conjecture are presently known. One approach consists of assuming the sum set A+AA + A small and then deriving that the product set AAAA is large (using Freiman's structure theorem). (cf [N-T], [Na3].) We follow the reverse route and prove that if AA<cA|AA| < c|A|, then A+A>cA2|A+A| > c^\prime |A|^2 (see Theorem 1). A quantitative version of this phenomenon combined with Pl\"unnecke type of inequality (due to Ruzsa) permit us to settle completely a related conjecture in [E-S] on the growth in kk. If g(k)min{A[1]+A{1}} g(k) \equiv \text{min}\{|A[1]| + |A\{1\}|\} over all sets AZA\subset \Bbb Z of cardinality A=k|A| = k and where A[1]A[1] (respectively, A{1}A\{1\}) refers to the simple sum (resp., product) of elements of AA. (See (0.6), (0.7).) It was conjectured in [E-S] that g(k)g(k) grows faster than any power of kk for kk\to\infty. We will prove here that ng(k)(nk)2nnk\ell n g(k)\sim\frac{(\ell n k)^2}{\ell n \ell n k} (see Theorem 2) which is the main result of this paper.

Keywords

Cite

@article{arxiv.math/0402285,
  title  = {The Erd\H{o}s-Szemer\'edi problem on sum set and product set},
  author = {Mei-Chu Chang},
  journal= {arXiv preprint arXiv:math/0402285},
  year   = {2007}
}

Comments

19 pages published version