ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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 ∣A∣cgeqcdeltaN|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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.