Skip to main content Accessibility help

On Sumsets of Convex Sets


A set of reals A = {a1,. . .,an} is called convex if ai+1ai > aiai−1 for all i. We prove, among other results, that for some c > 0 every convex A satisfies |AA| ≥ c|A|8/5log−2/5|A|.

Hide All
[1]Elekes, G., Nathanson, M. and Ruzsa, I. Z. (2000) Convexity and sumsets. J. Number Theory 83 194201.
[2]Garaev, M. Z. (2000) On lower bounds for the L 1-norm of exponential sums. Math. Notes 68 713720.
[3]Garaev, M. Z. (2007) On an additive representation associated with the L 1-norm of an exponential sum. Rocky Mountain J. Math. 56 15511556.
[4]Garaev, M. Z. (2007) On the number of solutions of a diophantine equation with symmetric entries. J. Number Theory 125 201209.
[5]Garaev, M. Z. and Kueh, K.-L. (2005) On cardinality of sumsets. J. Aust. Math. Soc. 78 221224.
[6]Hegyvári, N. (1986) On consecutive sums in sequences. Acta Math. Acad. Sci. Hungar. 48 193200.
[7]Iosevich, A., Konyagin, V. S., Rudnev, M. and Ten, V. (2006) Combinatorial complexity of convex sequences. Discrete Comput. Geom. 35 143158.
[8]Katz, N. H. and Koester, P. (2010) On additive doubling and energy. SIAM J. Discrete Math. 24 16841693.
[9]Konyagin, V. S. (2000) An estimate of the L 1-norm of an exponential sum. In The Theory of Approximations of Functions and Operators: Abstracts of Papers of the International Conference Dedicated to Stechkin's 80th Anniversary (in Russian), pp. 88–89.
[10]Sanders, T. (2010) On a non-abelian Balog–Szemerédi-type lemma. J. Aust. Math. Soc. 89 127132.
[11]Sanders, T. On Roth's theorem on progressions. Ann. of Math., to appear.
[12]Schoen, T. (2011) Near optimal bounds in Freiman's theorem. Duke Math. J. 158 112.
[13]Schoen, T. and Shkredov, I. D. Additive properties of multiplicative subgroups of . Quart. J. Math., to appear.
[14]Shkredov, I. D. and V'ugin, I. V. Additive shifts of multiplicative subgroups. Mat. Sbornik, to appear.
[15]Solymosi, J. (2009) Sumas contra productos. Gaceta de la Real Sociedad Matematica Española,12 (4).
[16]Szemerédi, E. and Trotter, W. T. (1983) Extremal problems in discrete geometry. Combinatorica 3 381392.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed