On Sumsets of Convex Sets

DOI10.1017/S0963548311000277zbMath1306.11013arXiv1105.3542MaRDI QIDQ3103628

Tomasz Schoen, Ilya D. Shkredov

Publication date: 8 December 2011

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1105.3542

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (30)

On the number of unit-area triangles spanned by convex grids in the plane ⋮ On sums of Szemerédi-Trotter sets ⋮ On sum sets and convex functions ⋮ On Distinct Consecutive Differences ⋮ Interview with Larry Guth ⋮ Higher convexity and iterated sum sets ⋮ Sumsets of semiconvex sets ⋮ Higher convexity and iterated second moment estimates ⋮ Some new results on higher energies ⋮ An update on the sum-product problem ⋮ On the Minkowski distances and products of sum sets ⋮ Diameter‐free estimates for the quadratic Vinogradov mean value theorem ⋮ Convex sequences may have thin additive bases ⋮ Variations on the Sum-Product Problem II ⋮ Higher moments of convolutions ⋮ A convex set with a rich difference ⋮ Sharpening an estimate of the size of the sumset of a convex set ⋮ Decoupling estimates in Fourier analysis ⋮ On the few products, many sums problem ⋮ NEW RESULTS ON SUM‐PRODUCT TYPE GROWTH OVER FIELDS ⋮ Additive properties of slowly increasing convex sets ⋮ Long regularly-spaced and convex sequences in dense sets of integers ⋮ An elementary analog of the operator method in additive combinatorics ⋮ Energies and structure of additive sets ⋮ Convex polygons in Cartesian products ⋮ Difference sets are not multiplicatively closed ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ On higher energy decompositions and the sum–product phenomenon ⋮ Variations on the Sum-Product Problem ⋮ New sum-product type estimates over finite fields

Cites Work

• Near optimal bounds in Freiman's theorem
• Extremal problems in discrete geometry
• Combinatorial complexity of convex sequences
• On the number of solutions of a Diophantine equation with symmetric entries
• On consecutive sums in sequences
• Convexity and sumsets
• On an additive representation associated with the \(L_1\)-norm of an exponential sum
• On Additive Doubling and Energy
• ON A NONABELIAN BALOG–SZEMERÉDI-TYPE LEMMA
• On cardinality of sumsets
• On lower bounds for the \(L_1\)-norm of exponential sums

This page was built for publication: On Sumsets of Convex Sets