Convexity and sumsets
From MaRDI portal
Publication:1581869
DOI10.1006/JNTH.1999.2386zbMATH Open0998.11010OpenAlexW1998666916MaRDI QIDQ1581869FDOQ1581869
Authors: György Elekes, Melvyn B. Nathanson, 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
Recommendations
Cites Work
- Title not available (Why is that?)
- On the number of sums and products
- Repeated angles in the plane and related problems
- Title not available (Why is that?)
- Extremal problems in discrete geometry
- Combinatorial complexity bounds for arrangements of curves and spheres
- On consecutive sums in sequences
- Title not available (Why is that?)
- On sums and products of integers
Cited In (53)
- Large convex sets in difference sets
- A better than \(3/2\) exponent for iterated sums and products over \(\mathbb{R}\)
- Convexity, squeezing, and the Elekes-Szabó theorem
- Convexity of Distinct Sum Sets
- New sum-product type estimates over finite fields
- On sets defining few ordinary lines
- On cardinality of sumsets
- On distinct consecutive \(r\)-differences
- Additive properties of slowly increasing convex sets
- Contractions and expansion
- A bipartite strengthening of the crossing Lemma
- On sumsets and convex hull
- On multiple sum and product sets of finite sets of integers.
- Convexity of integer veto and elimination procedures
- Convex sequences may have thin additive bases
- New results on the Erdős-Szemerédi sum-product problems.
- Classification of maps sending lines into translates of a curve
- Addition and subtraction of homothety classes of convex sets
- On the size of the set \(AA+A\)
- An improved bound for the size of the set \(A/A+A\)
- Combinatorial complexity of convex sequences
- A successful concept for measuring non-planarity of graphs: The crossing number.
- On sumsets on convex sets
- On sum sets and convex functions
- Sumsets and the convex hull
- A Bipartite Strengthening of the Crossing Lemma
- On sums of Szemerédi-Trotter sets
- Title not available (Why is that?)
- On the number of solutions of a Diophantine equation with symmetric entries
- Fourier analysis and expanding phenomena in finite fields
- Higher convexity and iterated sum sets
- Expanders with superquadratic growth
- Sum-product theorems and incidence geometry
- On convolutions of convex sets and related problems
- A convex set with a rich difference
- \(L_1\)-norms of exponential sums and the corresponding additive problem
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- New combinations of convex sets
- On the number of unit-area triangles spanned by convex grids in the plane
- New results for the growth of sets of real numbers
- Convexity and a sum-product type estimate
- Few distinct distances implies no heavy lines or circles
- On the few products, many sums problem
- Higher convexity and iterated second moment estimates
- Sharpening an estimate of the size of the sumset of a convex set
- On distinct consecutive differences
- Upper bounds for the number of solutions of a Diophantine equation
- Convex polygons in Cartesian products
- How to find groups?
- Algebraic methods in sum-product phenomena
- Sets with few distinct distances do not have heavy lines
- On the size of $k$-fold sum and product sets of integers
- Sumsets of semiconvex sets
This page was built for publication: Convexity and sumsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1581869)
