Treffer: On sums and products of integers

Title:
On sums and products of integers
Authors:
Yong-Gao Chen
Source:
Proceedings of the American Mathematical Society. 127:1927-1933
Publisher Information:
American Mathematical Society (AMS), 1999.
Publication Year:
1999
Subject Terms:
Other combinatorial number theory, sumsets, sums and products of integers, 0101 mathematics, 01 natural sciences
Document Type:
Fachzeitschrift Article<br />Other literature type
File Description:
application/xml
Language:
English
ISSN:
1088-6826
0002-9939
DOI:
10.1090/s0002-9939-99-04833-9
Access URL:
https://www.ams.org/proc/1999-127-07/S0002-9939-99-04833-9/S0002-9939-99-04833-9.pdf
https://zbmath.org/1289015
https://doi.org/10.1090/s0002-9939-99-04833-9
https://www.ams.org/journals/proc/1999-127-07/S0002-9939-99-04833-9/home.html
https://documat.unirioja.es/servlet/articulo?codigo=477787
https://dialnet.unirioja.es/servlet/articulo?codigo=477787
Rights:
URL: https://www.ams.org/publications/copyright-and-permissions
Accession Number:
edsair.doi.dedup.....caf2c585751abac87761c5769d19b0f2
Database:
OpenAIRE

Weitere Informationen

Erdös and Szemerédi proved that if A A is a set of k k positive integers, then there must be at least c k 1 + δ ck^{1+\delta } integers that can be written as the sum or product of two elements of A A , where c c is a constant and δ > 0 \delta >0 . Nathanson proved that the result holds for δ = 1 31 \delta =\frac 1{31} . In this paper it is proved that the result holds for δ = 1 5 \delta =\frac 15 and c = 1 20 c=\frac 1{20} .