On multiple sum and product sets of finite sets of integers

Jean Bourgain; Mei-Chu Chang

doi:10.1016/j.crma.2003.08.010

Combinatorics/Number Theory

On multiple sum and product sets of finite sets of integers

Presented by: Jean Bourgain

Jean Bourgain ¹; Mei-Chu Chang ²

¹ Institute for Advanced Study, Olden Lane, Princeton, NJ 08540, USA
² Mathematics Department, University of California, Riverside, CA 92521, USA

Comptes Rendus. Mathématique, Volume 337 (2003) no. 8, pp. 499-503.

Abstract
Résumé

Let $A \subset ℤ$ be a finite set of integers of cardinality |A|=N⩾2. Given a positive integer k, denote kA (resp. A^(k)) the set of all sums (resp. products) of k elements of A. We prove that for all b>1, there exists k=k(b) such that max(|kA|,|A^(k)|)>N^b. This answers affirmably questions raised in Erdős and Szemerédi (Stud. Pure Math., 1983, pp. 213–218), Elekes et al. (J. Number Theory 83 (2) (2002) 194–201) and recently, by S. Konjagin (private communication). The method is based on harmonic analysis techniques in the spirit of Chang (Ann. Math. 157 (2003) 939–957) and combinatorics on graphs.

Soit $A \subset ℤ$ un ensemble fini d'entiers et |A|=N⩾2. Pour tout entier positif k, denotons kA (resp. A^(k)) l'ensemble de toutes les sommes (resp. produits) de k éléments de A. On démontre que pour tout b>1, il existe k=k(b) tel que max(|kA|,|A^(k)|)>N^b. Ceci répond affirmativement à des questions posées dans Erdős et Szemerédi (Stud. Pure Math., 1983, pp. 213–218), Elekes et al. (J. Number Theory 83 (2) (2002) 194–201) et, récemment, par S. Konjagin (communication privée). La méthode est basée sur des arguments d'analyse harmonique dans l'esprit de Chang (Ann. Math. 157 (2003) 939–957) et de la combinatoire sur des graphes.

Received: 2003-08-11
Accepted: 2003-08-30
Published online: 2003-10-15

DOI: 10.1016/j.crma.2003.08.010

Author's affiliations:

Jean Bourgain ¹; Mei-Chu Chang ²

¹ Institute for Advanced Study, Olden Lane, Princeton, NJ 08540, USA
² Mathematics Department, University of California, Riverside, CA 92521, USA

@article{CRMATH_2003__337_8_499_0,
     author = {Jean Bourgain and Mei-Chu Chang},
     title = {On multiple sum and product sets of finite sets of integers},
     journal = {Comptes Rendus. Math\'ematique},
     pages = {499--503},
     publisher = {Elsevier},
     volume = {337},
     number = {8},
     year = {2003},
     doi = {10.1016/j.crma.2003.08.010},
     language = {en},
}

TY  - JOUR
AU  - Jean Bourgain
AU  - Mei-Chu Chang
TI  - On multiple sum and product sets of finite sets of integers
JO  - Comptes Rendus. Mathématique
PY  - 2003
SP  - 499
EP  - 503
VL  - 337
IS  - 8
PB  - Elsevier
DO  - 10.1016/j.crma.2003.08.010
LA  - en
ID  - CRMATH_2003__337_8_499_0
ER  -

%0 Journal Article
%A Jean Bourgain
%A Mei-Chu Chang
%T On multiple sum and product sets of finite sets of integers
%J Comptes Rendus. Mathématique
%D 2003
%P 499-503
%V 337
%N 8
%I Elsevier
%R 10.1016/j.crma.2003.08.010
%G en
%F CRMATH_2003__337_8_499_0

Jean Bourgain; Mei-Chu Chang. On multiple sum and product sets of finite sets of integers. Comptes Rendus. Mathématique, Volume 337 (2003) no. 8, pp. 499-503. doi : 10.1016/j.crma.2003.08.010. https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.1016/j.crma.2003.08.010/

References
Cited by

[1] J. Bourgain On the Erdős–Volkmann and Katz–Tao Ring Conjectures, Geom. Funct. Anal., Volume 13 (2003)

[2] M. Chang The Erdős–Szemerédi problem on sum set and product set, Ann. of Math., Volume 157 (2003), pp. 939-957

[3] G. Elekes; M. Nathanson; I. Ruzsa Convexity and sumsets, J. Number Theory, Volume 83 (2000) no. 2, pp. 194-201

[4] P. Erdős; E. Szemerédi On Sums and Products of Integers, Stud. Pure Math., Birkhäuser, Basel, 1983 (pp. 213–218)

[5] S. Konjagin, Private communication

[6] M.B. Nathanson Additive Number Theory, Inverse Problems and the Geometry of Sumsets, Graduate Text in Math., 165, Springer-Verlag, New York, 1996

[7] W. Rudin Trigonometric series with gaps, J. Math. Mech., Volume 9 (1960), pp. 203-227

[8] J. Solymosi, On the number of sums and products, Preprint, 2003

Cited by Sources:

Comments - Policy