ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n,k∈Nn,k\in\mathbb N, and consider the finite game in which the coefficients satisfy the zero-sum normalization from the Manickam–Miklós–Singhi problem. Two solutions are equivalent under permutations. Finite-game conjecture. The optimal solution has the form

a1=⋯=aq,a_1=\cdots=a_q,

where q∈{1,2,3,5}q\in\{1,2,3,5\}, and

aq+1=⋯=an=−qn−qa1.a_{q+1}=\cdots=a_n=-\frac{q}{n-q}a_1.

This is the only optimal solution up to equivalence. It is presented as the finite counterpart of the proposed limit-game classification, and remains unproved in the 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.