In what follows A will always denote a finite subset of the non-zero reals, and n the number of its elements. As usual, A + A and A · A stand for the sets of all pairwise sums {a + a : a, a ∈ A} and products {a · a : a, a ∈ A}, respectively. Also, |S| denotes the size of a set S. The following problem was posed by Erd˝ os and Szemerédi (see [5]): For a given n, how small can one make |A + A| and |A · A| simultaneously? In other words, defining m(A) := max{|A + A|, |A · A|}, a lower estimate should be found for g(n) := min |A|=n m(A). R e m a r k. The philosophy behind the question is that either of |A + A| or |A · A| is easy to minimize—just take an arithmetic or geometric (i.e., exponential) progression for A. However, in both of these examples, the other set becomes very large. In their above mentioned paper, Erd˝ os and Szemerédi managed to prove the existence of a small but positive constant c 1 such that g(n) ≥ n 1+c 1 for all n. (See also p. 107 of Erd˝ os' paper [3].) Later on, Nathanson and K. Ford found the lower bounds n 32/31 and n 16/15 , respectively [7]. The goal of this paper is to improve the exponent to 5/4. Theorem 1. There is a positive absolute constant c such that, for every n-element set A, c · n 5/4 ≤ max{|A + A|, |A · A|}.
[1]
József Beck,et al.
On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
,
1983,
Comb..
[2]
Leonidas J. Guibas,et al.
Combinatorial complexity bounds for arrangements of curves and spheres
,
1990,
Discret. Comput. Geom..
[3]
Kenneth L. Clarkson,et al.
Combinatorial complexity bounds for arrangements of curves and surfaces
,
2015,
[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[4]
Endre Szemerédi,et al.
Extremal problems in discrete geometry
,
1983,
Comb..
[5]
Paul Erdős,et al.
Studies in Pure Mathematics: To the Memory of Paul Turán
,
1983
.
[6]
L. A. Oa,et al.
Crossing Numbers and Hard Erd} os Problems in Discrete Geometry
,
1997
.
[7]
Yong-Gao Chen,et al.
On sums and products of integers
,
1999
.