The basic theme of this paper is the fact that if 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 small and then deriving that the product set is large (using Freiman’s structure theorem). (cf [N-T], [Na3].) We follow the reverse route and prove that if , then (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 . If over all sets $A\subset \Bbb Z|A| = kA[1]A{1}$) refers to the simple sum (resp., product) of elements of . (See (0.6), (0.7).) It was conjectured in [E-S] that grows faster than any power of for . We will prove here that $\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.

生成讲解博客的中文版本

生成AI智能校验的中文版本