Kra–Moreira–Richter–Robertson logarithmic growth conjecture for finite sumsets

For cdeltacin(0,1)cdelta cin (0,1) and NcinmathbbNNcinmathbb{N}, let cphicdelta(N)cphi_{cdelta}(N) be the largest integer such that every set Acsubseteq[N]Acsubseteq [N] with AcgeqcdeltaN|A|cgeq cdelta N contains a sumset B+CB+C, where B,Ccsubseteq[N]B,Ccsubseteq [N] and cminc{|B|,|C|cgeq cphi_{cdelta}(N). Kra–Moreira–Richter–Robertson conjecture. For every cdeltacin(0,1)cdeltacin(0,1),

0<climinfNctocinftycphicdelta(N)clog(N)0<climinf_{Nctocinfty}\frac{cphi_{cdelta}(N)}{clog(N)}

and

climsupNctocinftycphicdelta(N)clog(N)<cinfty.climsup_{Nctocinfty}\frac{cphi_{cdelta}(N)}{clog(N)}<cinfty.

This conjecture asserts that the largest guaranteed summands in dense finite subsets of [N][N] have logarithmic order, bounded above and below by positive constants depending on the density. It was posed by Kra, Moreira, Richter and Robertson; its resolution is not established in the supplied source.

Sources & referencesView supporting material

Primary source

Felipe Hernández and Luke Hetzel, “On growth rates of infinite and finite sumsets”, arXiv:2606.07310 (2026).

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.