Convexity and sumsets

Journal of Number Theory

Volumn 83, Issue 2, 2000, Pages 194-201

  Elekes, György ^a   Nathanson, Melvyn B ^a   Ruzsa, Imre Z ^b  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^b ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034239333     PISSN: 0022314X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jnth.1999.2386     Document Type: Article

References (10)

1. 1. K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, Combinatorial complexity bounds for arrangements of curves and surfaces, Discrete Comput. Geom. 5 (1990), 99-106.
2. 2. Gy. Elekes, On the number of sums and products, Acta Arith. 81 (1997), 365-367.
3. 3. P. Erdos and E. Szemerédi, On sums and products of integers, in "Studies in Pure Math. to the Memory of P. Turán," pp. 213-218, Akadémiai Kiadó, Budapest, 1983.
4. 4. N. Hegyvári, On consecutive sums in sequences, Acta Math. Acad. Sci. Hungar. 48 (1986), 193-200.
5. 5. M. B. Nathanson, "Additive Number Theory: The Classical Bases," Graduate Texts in Mathematics, Vol. 164, Springer-Verlag, New York/Berlin, 1996.
6. 6. M. B. Nathanson, On sums and products of integers, Proc. Amer. Math. Soc. 125 (1997), 9-16.
7. 7. J. Pach and P. K. Agarwal, "Combinatorial Geometry," Wiley, New York/Chichester, 1995.
8. 8. J. Pach and M. Sharir, Repeated angles in the plane and related problems, J. Combin. Theory Ser. A 59 (1990), 12-22.
9. 9. L. A. Székely, Crossing numbers and hard Erdos problems in discrete geometry, Combin. Probab. Comput. 11 (1993), 1-10.
10. 10. E. Szemerédi and W. T. Trotter, Jr., Extremal problems in discrete geometry, Combinatorica 3 (1983), 381-392.