Limit-game conjecture for the Manickam–Miklós–Singhi problem
Statement
Fix . In the limit game, an admissible strategy is a countable sequence of coefficients, with all but finitely many coefficients zero in the stated candidate solutions; solutions are equivalent under the relevant permutations. Limit-game conjecture. The optimal solution has the form
for some , with all other coefficients equal to , and this is the only optimal solution up to equivalence. This conjecture summarizes the paper’s analysis of the limit problem; no proof or disproof is supplied.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.