← All problems

Erdős's convex sumset conjecture

7 years old · traced to

Let A⊂RA\subset\mathbb{R} be a finite convex set, meaning that if A={a1<a2<⋯<ak}A=\{a_1<a_2<\cdots<a_k\}, then

ai−ai−1<ai+1−aia_i-a_{i-1}<a_{i+1}-a_i

for every 1<i<k1<i<k. Erdős's conjecture. For every ϵ>0\epsilon>0,

∣A+A∣≫ϵ∣A∣2−ϵ.|A+A|\gg_{\epsilon}|A|^{2-\epsilon}.

This conjecture concerns the additive growth of convex sets. The paper proves a related lower bound for sums with an arbitrary finite set, but the stated conjecture remains open.

References
  1. Imre Ruzsa, George Shakan, Jozsef Solymosi and Endre Szemerédi, “On distinct consecutive differences”, arXiv:1910.02159 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.