Convexity and sumsets

DOI10.1006/JNTH.1999.2386zbMath0998.11010OpenAlexW1998666916MaRDI QIDQ1581869

Melvyn B. Nathanson, György Elekes, Imre Z. Ruzsa

Publication date: 11 January 2001

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jnth.1999.2386

zbMATH Keywords

sumsetsaddition of sets

Mathematics Subject Classification ID

Density, gaps, topology (11B05)

Related Items (35)

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 ⋮ Higher convexity and iterated sum sets ⋮ Sumsets of semiconvex sets ⋮ Higher convexity and iterated second moment estimates ⋮ MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS ⋮ Expanders with superquadratic growth ⋮ On sets defining few ordinary lines ⋮ A convex set with a rich difference ⋮ Classification of maps sending lines into translates of a curve ⋮ Convexity, squeezing, and the Elekes-Szabó theorem ⋮ On the few products, many sums problem ⋮ Few distinct distances implies no heavy lines or circles ⋮ On multiple sum and product sets of finite sets of integers. ⋮ On the size of the set AA+A ⋮ A successful concept for measuring non-planarity of graphs: The crossing number. ⋮ On distinct consecutive \(r\)-differences ⋮ Sum-product theorems and incidence geometry ⋮ Fourier analysis and expanding phenomena in finite fields ⋮ How to find groups? ⋮ Upper bounds for the number of solutions of a Diophantine equation ⋮ Algebraic methods in sum-product phenomena ⋮ A bipartite strengthening of the crossing Lemma ⋮ On cardinality of sumsets ⋮ A Bipartite Strengthening of the Crossing Lemma ⋮ Unnamed Item ⋮ Convex polygons in Cartesian products ⋮ On the size of $k$-fold sum and product sets of integers ⋮ On Sumsets of Convex Sets ⋮ Sets with few distinct distances do not have heavy lines ⋮ \(L_1\)-norms of exponential sums and the corresponding additive problem ⋮ New sum-product type estimates over finite fields ⋮ New results on the Erdős-Szemerédi sum-product problems.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal problems in discrete geometry
• Combinatorial complexity bounds for arrangements of curves and spheres
• On consecutive sums in sequences
• Repeated angles in the plane and related problems
• On the number of sums and products
• On sums and products of integers

This page was built for publication: Convexity and sumsets