ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PP be a 3M-DAP that is not a 0-problem, and let P′P' be the smaller 3M-DAP obtained from PP by one application of the recursive algorithm. Let g(P)g(P) denote the size of the smallest piece in the solution produced by that algorithm.

Recursive value conjecture. For any 3M-DAP PP that is not a 0-problem,

g(P)=g(P′).g(P)=g(P').

The source says that it proves this conjecture in the subsequent analysis. Therefore its status is solved.

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.