ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let xx and yy be polynomials of degree at most nn, and let [?][?] denote the supremum of the optimization problem in the Belgian Chocolate Problem. A value of [?][?] is quasi-admissible if it can be achieved by polynomials x,y,zx,y,z formed via algebraic specification.

Algebraic specification conjecture. For all nn, [?][?] is quasi-admissible by some x,y,zx,y,z that are formed via algebraic specification.

The conjecture formalizes the empirical observation that admissible values approach quasi-admissible values obtained through algebraic specification. The source provides numerical evidence and notes that [?][?] is not admissible by x,yx,y of degree at most nn, but does not establish the conjecture.

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.